Simplifying the Topology of Volume Datasets: An Opportunistic Approach Authors

Understanding isosurfaces and contours (their connected components) is important for the analysis as well as effective visualization of 3D scalar fields. The topological changes that the contours undergo as the isovalue varies are typically represented using the contour tree, which can be obtained from the input scalar field by collapsing every contour to a single point. Contour trees are known to provide useful information, allowing one to find interesting isovalues and contours, speed up computations involving isosurfaces or contours, or analyze or visualize the scalar field’s qualitative structure. However, the applicability of contour trees can, in many cases, be problematic because of their large size. Morse theory relates the contour topology changes to critical points in the underlying scalar fields. We describe a simple algorithm that can decrease the number of critical points in a regularly sampled volume dataset. The procedure produces a perturbed version of the input volume that has fewer critical points but, at the same time, is guaranteed to be less than a user-specified threshold away from the input volume (in the supremum norm sense). Because the input and output volumes are close, the algorithm preserves the most stable topological features of the scalar field. Although we do not guarantee that the number of critical points in the output volume is minimum among all volumes within the threshold away from the input dataset, our experiments demonstrate that the procedure is quite effective for a variety of input data types. Apart from reducing the size of the contour tree, it also reduces the topological complexity of individual isosurfaces.

[1]  Yi-Jen Chiang,et al.  Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies , 2003, Comput. Graph. Forum.

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

[3]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.

[4]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Gilles Bertrand,et al.  A three-dimensional holes closing algorithm , 1996, Pattern Recognit. Lett..

[6]  坂上 貴之.  書評 Computational Homology , 2005 .

[7]  Renato Pajarola,et al.  Topology preserving and controlled topology simplifying multiresolution isosurface extraction , 2000 .

[8]  B. Hamann,et al.  A multi-resolution data structure for two-dimensional Morse-Smale functions , 2003, IEEE Visualization, 2003. VIS 2003..

[9]  Herbert Edelsbrunner,et al.  An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere , 1995, Comput. Aided Geom. Des..

[10]  Zoë J. Wood,et al.  Isosurface Topology Simplification , 2002 .

[11]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

[12]  Konstantin Mischaikow,et al.  Graph Approach to the Computation of the Homology of Continuous Maps , 2005, Found. Comput. Math..

[13]  Jack Snoeyink,et al.  Simplifying flexible isosurfaces using local geometric measures , 2004, IEEE Visualization 2004.

[14]  Mikhail N. Vyalyi,et al.  Construction of contour trees in 3D in O(n log n) steps , 1998, SCG '98.

[15]  Yi-Jen Chiang,et al.  Simple and Optimal Output-Sensitive Computation of Contour Trees , 2000 .

[16]  Jihad El-Sana,et al.  Controlled simplification of genus for polygonal models , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[17]  M. V. D. Panne,et al.  Topological manipulation of isosurfaces , 2004 .

[18]  Valerio Pascucci,et al.  Morse-smale complexes for piecewise linear 3-manifolds , 2003, SCG '03.

[19]  Lynn Arthur Steen,et al.  Counterexamples in Topology , 1970 .

[20]  Andrzej Szymczak,et al.  Making contour trees subdomain-aware , 2004, CCCG.

[21]  Valerio Pascucci,et al.  The contour spectrum , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[22]  Emden R. Gansner,et al.  An open graph visualization system and its applications to software engineering , 2000 .

[23]  Valerio Pascucci,et al.  Efficient computation of the topology of level sets , 2002, IEEE Visualization, 2002. VIS 2002..

[24]  Zoë J. Wood,et al.  Topological Noise Removal , 2001, Graphics Interface.

[25]  Xiao Han,et al.  A topology preserving deformable model using level sets , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[26]  James Vanderhyde,et al.  Extraction of topologically simple isosurfaces from volume datasets , 2003, IEEE Visualization, 2003. VIS 2003..

[27]  Herbert Edelsbrunner,et al.  Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds , 2003, Discret. Comput. Geom..

[28]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..