Isosurface Topology Simplification

Many high-resolution surfaces are created through isosurface extraction from volumetric representations, obtained by 3D photography, CT, or MRI. Noise inherent in the acquisition process can lead to geometrical and topological errors. Reducing geometrical errors during reconstruction is well studied. However, isosurfaces often contain many topological errors, in the form of tiny topological handles. These nearly invisible artifacts hinder subsequent operations like mesh simplification, compression, and parameterization. In this paper we present an efficient scheme for removing topological handles in an isosurface. Our scheme makes an axis-aligned sweep through the volume to locate handles, compute their sizes, and selectively remove them. Additionally, the algorithm is designed for out-of-core execution. It finds the handles by incrementally constructing and analyzing a surface Reeb graph. The size of a handle is measured as the shortest surface loop that breaks it. Handles are removed robustly by modifying the volume rather than attempting “mesh surgery.” Finally, the volumetric modifications are spatially localized to preserve geometrical detail. We demonstrate topology simplification on several complex models, and show its benefit for subsequent surface processing. Additional

[1]  David Metcalf,et al.  A Digital Brain Atlas for Surgical Planning, Model-Driven Segmentation, and Teaching , 1996, IEEE Trans. Vis. Comput. Graph..

[2]  Jacques-Olivier Lachaud Topologically defined iso-surfaces , 1996, DGCI.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Tosiyasu L. Kunii,et al.  Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.

[5]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[7]  Amitabh Varshney,et al.  Controlled Topology Simplification , 1996, IEEE Trans. Vis. Comput. Graph..

[8]  Pierre Alliez,et al.  Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.

[9]  Pedro V. Sander,et al.  Texture mapping progressive meshes , 2001, SIGGRAPH.

[10]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[11]  Richard M. Leahy,et al.  Automated graph-based analysis and correction of cortical volume topology , 2001, IEEE Transactions on Medical Imaging.

[12]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[13]  Adrian Hilton,et al.  Reliable Surface Reconstructiuon from Multiple Range Images , 1996, ECCV.

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

[15]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[16]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[17]  Greg Turk,et al.  Simplification and Repair of Polygonal Models Using Volumetric Techniques , 2003, IEEE Trans. Vis. Comput. Graph..

[18]  Herbert Edelsbrunner,et al.  Auditory Morse Analysis of Triangulated Manifolds , 1997, VisMath.

[19]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

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

[21]  John Fitch,et al.  Course notes , 1975, SIGS.

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

[23]  David E. Breen,et al.  Semi-regular mesh extraction from volumes , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[24]  William S. Massey,et al.  Algebraic Topology: An Introduction , 1977 .

[25]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[26]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.