Abstract
In this paper, we present a fast, table-driven isosurface extraction technique on volumetric data. Unlike Marching Cubes or other cell-based algorithms, the proposed polygonization generates convex negative space inside individual cells, enabling fast collision detection on the triangulated isosurface. In our implementation, we are able to perform over 2 million point classifications per second. The algorithm is driven by an automatically constructed lookup table that stores compact decision trees by sign configurations. The decision trees determine triangulations dynamically by values at cell corners. Using the same technique, we can perform fast, crack-free multiresolution contouring on nested grids of volumetric data. The method can also be extended to extract isosurfaces on arbitrary convex, space-filling polyhedra.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker HH (1989) Building surfaces of evolution: the weaving wall. Int J Comput Vis 3:51–71
Bloomenthal J (1988) Polygonization of implicit surfaces. Comput Aided Geom Des 5:341–355
Boada I, Navazo I (2001) Multiresolution isosurface fitting using an octree based surface hierachy. Research Report IIiA 01-02-RR, Institut de Informàtica i Aplicaciones, University of Girona, Spain
Duurst MJ (1988) Additional reference to marching cubes. Comput Graph 22(2):72–73
Van Gelder A, Wilhelms J (1994) Topological considerations in isosurface generation. ACM Trans Graph 13(4):337–375
Guy RK (1958) Dissecting a polygon into triangles. Bull Malayan Math Soc 5:57–60
Lorensen W, Cline H (1987) Marching Cubes: a high resolution 3D surface construction algorithm. In: Proceedings of SIGGRAPH ’87, Anaheim, CA, 27–31 July 1987. Comput Graph 21(4):163–169
Muller H, Stark M (1993) Adaptive generation of surfaces in volume data. Vis Comput 9(4):182–199
Nielson GM, Hamann B (1991) The asymptotic decider: resolving the ambiguity in Marching Cubes. In: Proceedings of the IEEE visualization conference, Los Altimos, CA, October 1991, pp 83–91
Ning P, Bloomenthal J (1993) An evaluation of implicit surface tiles. IEEE Comput Graph Appl 13(6):33–41
Poston T, Wong TT, Heng PA (1998) Multiresolution isosurface extraction with adaptive skeleton climbing. Comput Graph Forum 17(3):137–148
Shekhar R, Fayyad E, Yagel R, Cornhil JF (1996) Octree-based decimation of Marching Cubes surfaces. In: Proceedings of IEEE Visualization ’96 conference, San Francisco, 27 October–1 November 1996, pp 335–344
Wallin A (1991) Constructing isosurfaces from CT data. IEEE Comput Graph Appl 11(6):28–33
Westermann R, Kobbelt L, Ertl T (1999) Real-time exploration of regular volume data by adaptive reconstruction of isosurfaces. Vis Comput 15:100–111
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ju, T., Schaefer, S. & Warren, J. Convex contouring of volumetric data. Vis Comput 19, 513–525 (2003). https://doi.org/10.1007/s00371-003-0216-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-003-0216-0