Marching cubes method with connectivity

In this paper, we solve the topological problem of isosurfaces generated by the marching cubes method using the approach of combinatorial topology. For each marching cube, we examine the connectivity of polyhedral configuration in the sense of combinatorial topology. For the cubes where the connectivities are not considered, we modify the polyhedral configurations with the connectivity and construct polyhedral isosurfaces with the correct topologies.

[1]  Jean Françon Discrete Combinatorial Surfaces , 1995, CVGIP Graph. Model. Image Process..

[2]  Atsushi Imiya,et al.  Boundary Extraction of Discrete Objects , 1998, Comput. Vis. Image Underst..

[3]  Atsushi Imiya,et al.  Discrete combinatorial geometry , 1997, Pattern Recognit..

[4]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.

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

[6]  J. Wilhelms,et al.  Topological considerations in isosurface generation extended abstract , 1990, SIGGRAPH 1990.

[7]  Roberto Scopigno,et al.  Discretized Marching Cubes , 1994, Proceedings Visualization '94.