论文信息 - Construction of contour trees in 3D in O(n log n) steps

Construction of contour trees in 3D in O(n log n) steps

We outline an O(n log n) algorithm for computing the contour trees for simplicial meshes with n elements in 3D. As a byproduct we describe an O(nlog n) algorithm for “resolution” of singularities of piecewise-linear functions in 3D (i.e., transforming singularities into simple Morse-like ones by subdividing the mesh).

Mikhail N. Vyalyi | Sergey P. Tarasov

[1] T. Banchoff. CRITICAL POINTS AND CURVATURE FOR EMBEDDED POLYHEDRA , 1967 .

[2] W. Thurston,et al. A presentation for the mapping class group of a closed orientable surface , 1980 .

[3] C. Rourke,et al. Introduction to Piecewise-Linear Topology , 1972 .

[4] Mark de Berg,et al. Trekking in the Alps Without Freezing or Getting Tired , 1993, ESA.

[5] O. R. Musin. On some problems of computational geometry and topology , 1992 .

[6] Mikhail N. Vyalyi,et al. Some PL functions on surfaces are not height functions , 1997, SCG '97.

[7] Valerio Pascucci,et al. Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

[8] Tosiyasu L. Kunii,et al. Surface coding based on Morse theory , 1991, IEEE Computer Graphics and Applications.