Preserving Zeros in Surface Construction using Marching Cubes

• Autorzy: Liu S. , Li J.
• Języki publikacji: EN

Abstrakty

EN

In surface construction, existing marching cubes (MC) methods require sample values at cell vertices to be non-zero after thresholding, or modify them otherwise. The modification may introduce problems in the constructed surface, such as topological changes, representation errors, and preference for positive or negative values. This paper presents a generalized MC algorithm. It constructs surface patches by exploiting cycles in cells without changing the sample values at vertices, and thus allows cell vertices with zero sample values to lie on the constructed surface. The simulation results show that the proposed Zero-Crossing MC method preserves better topologies of implicit surfaces that pass through cell vertices, and represents the surfaces more accurately. Its efficiency is comparable to existing MC methods in constructing surfaces.

Słowa kluczowe

EN

surface construction; marching cubes; zero crossing

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2010
• Tom: Vol. 19, No. 1
• Strony: 97--123
• Opis fizyczny: Bibliogr. 18 poz., il., rys., wykr.

Twórcy

autor

Liu S.

autor

Li J.

• Oakland University

Bibliografia

• [1] W. E. Lorensen and H. E. Cline: Marching cubes: A high-resolution 3D surface construction algorithm. Proceedings of the 14th annual conference on computer graphics and interactive techniques, 163-169, 1987.
• [2] G. M. Nielson and B. Hamann: The asymptotic decider: Resolving the ambiguity in marching cubes. Proceedings of Visualization '91, 29-38, 1991.
• [3] J. Wilhelms and A. V. Gelder: Octrees for faster isosurface generation. ACM Transactions on Graphics, 11(3), 201-227, 1992.
• [4] A. V. Gelder and J. Wilhelms: Topological considerations in isosurface generation. ACM Transactions on Graphics, 13(4), 337-375, 1994.
• [5] B. K. Nataranjan: On generating topologically consistent isosurfaces from uniform samples. The Visual Computer. 11(1), 52-62, 1994.
• [6] J. Bloornenthal and K. Ferguson: Polygonization of non-manifold implicit surfaces. ACM SIGGRAPH 1995, 309-316, 1995.
• [7] E. V. Chernyaev: Marching cubes 33: Construction of topologically correct isosurfaces. CERN, Geneva, Switzerland. Tech. Rep. CN/95-17, 1995.
• [8] R. Shekhar, E. Fayyad, R. Yagel. and J. F. Cornhill: Octree-based decimation of marching cubes surfaces. IEEE Visualization 1996, 335-342, 1996.
• [9] H.-C. Hege, M. Seebas, D. Stalling, and M. Zockler: A generalized marching cubes algorithm based on non-binary classifications. Zuse Institute Berlin (ZIB), Tech. Rep. SC 97-05, 1997.
• [10] R. Westerrnann, L. Kobbelt, and T. Ertl: Real-time exploration of regular volume data by adaptive reconstruction of iso-surfaces. The Visual Computer, 15(2), 100-111, 1999.
• [11] D. C. Banks and S. Linton: Counting cases in marching cubes: Toward a generic algorithm for producing substitopes. IEEE Visualization 2003, 51-58, 2003.
• [12] X. Han, C. Xu, and J. Prince: A topology preserving level set method for geometric deformable models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(6), 755-768.
• [13] T. Lewiner, H. Lopes, A. W. Vieira, and G. Tavares: Efficient implementation of marching cubes' cases with topological guarantees. Journal of Graphics Tools, 8(2), 1-15, 2003.
• [14] C.-C. Ho, P.-L. Lee, Y.-Y. Chuang, B.-Y. Chen, and M. Ouhyoung: Cubical marching squares: adaptive feature preserving surface extraction from volume data. EUROGRAPHICS, 24, 2005.
• [15] MathWorld: Eulerian Circuit, 2007. [Online]. Available: http://mathworld.wolfrarn.com/EulerianCircuit.html
• [16] MathWorld: Topology, 2007. [Online]. Available: http://mathworld.wolfram.com/Topology.html
• [17] S. Liu and J. Li: Enumerating all the marching cubes cases with zero cell vertices. SECS in Oakland University, 2007. [Online]. Available: http://www.secs.oakland.edu/~sliu2/MC/mc.htm
• [18] National Cancer Institute: Lung Image Database Consortium (LIDC) Materials, 2007. http://imaging.cancer. gov/reportsandpublications/ReportsandPresentations/LungImaging,