Abstract
A new approach for reducing the number of triangles representing an isosurface in volumetric data is presented. The basic idea is to classify the configurations of the marching cubes approach into types. Surface patches traversing neighboring cubes of the same type can be merged into patches, which can be approximated with fewer and larger triangles. Experimental results show that the number of triangles is about 50% of that obtained with the marching cubes algorithm, with comparable image quality. The execution time is somewhat longer than that of the marching cubes algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Artzy E, Frieder G, Herman GT (1981) The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm. Comput Graph Image Processing 15:1–24
Cline HE, Lorensen WE, Ludke S (1988) Two algorithms for the three-dimensional reconstruction of tomograms. Med Phys 15:320–327
Dürst MJ (1988) Letters — additional reference to “marching cubes”. In: Dill J (ed) Comput Graph 22:72–73
Elvins TT (1992) A survey of algorithms for volume visualization. Comput Graph (SIGGRAPH '92 Proceedings) 26:194–201
Fuchs H, Kedmen Z, Uselton S (1977) Optimal surface reconstruction from planar contours. Commun ACM 20:693–702
Gelder A Van, Wilhelms J (1994) Topological considerations in isosurface generation. ACM Trans Graph 13:57–62
Hamann B (1994) A data reduction scheme for triangulated surfaces. Comput Aided Geometric Design 11:197–214
Herman G, Liu H (1979) Three-dimensional display of human organs from computed tomograms. Computer Graphics and Image Processing 9:1–21
Hinker P, Hansen C (1993) Geometric optimization. Proceedings of Visualization '93, San Jose, California, IEEE Computer Society Press, pp 189–195
Lorensen W (1993) Extracting surfaces from medical volumes. 1993 SIGGRAPH Course Notes 21:66–75
Lorensen WE, Cline HE (1987) Marching cubes: a high resolution 3D surface construction algorithm In: Stone MC (ed) Comput Graph (SIGGRAPH '87 Proceedings 21:163–169
Müller H, Stark M (1993) Adaptive generation of surfaces in volume data. Visual Comput 9:182–199
Nielson GM, Hamann B (1991) The asymptotic decider: resolving the ambiguity in marching cubes. Proceedings of Visualization '91, IEEE Computer Society Press, Los Alamitos, California, pp 83–91
Ning P, Bloomenthal J (1993) An evaluation of implicit surface tilers. IEEE Comput Graph Appl 33–41
Ning P, Hesselink L (1992) Octree prunning for variable resolution isosurfaces. Proceedings of Computer Graphics International '92, Tokyo, pp 349–364
Schroeder WJ, Zarge JA, Lorensen WE (1992) Decimation of triangle meshes. In: Catmull EE (ed) Comput Graph (SIGGRAPH '92 Proceedings) 26:65–70
Turk G (1992) Re-tiling polygonal surfaces. In: Catmull EE (ed) Comput Graph (SIGGRAPH '92 Proceedings) 26:55–64
Wilhelms J, Gelder A Van (1992) Octrees for faster isosurface generation. ACM Trans Graph 11:57–62
Wyvill B, McPheeters G, Wyvill G (1986) Data structure for soft objects. Visual Comput 2:227–234
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Oh, KM., Park, K.H. A type-merging algorithm for extracting an isosurface from volumetric data. The Visual Computer 12, 406–419 (1996). https://doi.org/10.1007/BF01785873
Issue Date:
DOI: https://doi.org/10.1007/BF01785873