Isosurface Extraction of Volumetric Data Using Implicit Surface Polygonization

Isosurface extraction is always an interesting topic in the field of computer graphics and scientific visualization. This study surveys isosurface construction methods, particularly in implicit surface polygonization using tracking partition. An investigation is conducted on the implementation of it. With reference of original Jules Bloomenthal’s implementation, an extension of the implicit surface polygonization is developed with concern of real volumetric data. Rather than conventional methods, such as Marching Cubes and its variants, the method has advantages on time complexity, flexibility and is easy to implement. A brief comparison has been done among these methods. During the development, some practical issues, such as starting point placement, seed point generation, manifold surface, manifold-with-boundary, are addressed. Possible solutions of these problems are suggested. Some ideas on enhancement of the method are conveyed at end of this paper for further work.

[1]  Michael M. Kazhdan,et al.  Unconstrained isosurface extraction on arbitrary octrees , 2007, Symposium on Geometry Processing.

[2]  Gregory M. Nielson,et al.  Dual marching cubes , 2004, IEEE Visualization 2004.

[3]  Jules Bloomenthal Unchained Implicit Surfaces , 1997 .

[4]  P. Shirley,et al.  A polygonal approximation to direct scalar volume rendering , 1990, VVS.

[5]  Gregory M. Nielson,et al.  Dual Marching Tetrahedra: Contouring in the Tetrahedronal Environment , 2008, ISVC.

[6]  Jules Bloomenthal,et al.  An Implicit Surface Polygonizer , 1994, Graphics Gems.

[7]  Jane Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.

[8]  William E. Lorensen,et al.  Surface Rendering Versus Volume Rendering In Medical Imaging: Techniques And Applications , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[9]  E Chernyaev,et al.  Marching cubes 33 : construction of topologically correct isosurfaces , 1995 .

[10]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[11]  Paul Ning,et al.  An evaluation of implicit surface tilers , 1993, IEEE Computer Graphics and Applications.

[12]  LopesAdriano,et al.  Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing , 2003 .

[13]  Jules Bloomenthal,et al.  Polygonization of non-manifold implicit surfaces , 1995, SIGGRAPH.

[14]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

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

[16]  J. Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.