Discretized Marching Cubes

17 December 2002

proceedings article
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 281-287,
https://doi.org/10.1109/visual.1994.346308

Abstract

Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated.This paper presents an algorithm that considerably reduces the number of polygons generated by a Marching Cubes-like scheme without excessively increasing the overall computational complexity. The algorithm assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions, the extracted surfaces are composed of polygons lying within a finite number of incidences, thus allowing simple merging of the output facets into large coplanar polygons.An experimental evaluation of the proposed approach on datasets related to biomedical imaging and chemical modelling is reported.

Keywords

This publication has 14 references indexed in Scilit:

Massively parallel isosurface extraction
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
An evaluation of implicit surface tilers
IEEE Computer Graphics and Applications, 1993
Mesh optimization
Published by Association for Computing Machinery (ACM) ,1993
Adaptive generation of surfaces in volume data
The Visual Computer, 1993
Normal estimation in 3 D discrete space
The Visual Computer, 1992
Decimation of triangle meshes
ACM SIGGRAPH Computer Graphics, 1992
Topological considerations in isosurface generation extended abstract
ACM SIGGRAPH Computer Graphics, 1990
Octrees for faster isosurface generation
ACM SIGGRAPH Computer Graphics, 1990
Surface mapping brain function on 3D models
IEEE Computer Graphics and Applications, 1990
Fast surface tracking in three-dimensional binary images
Computer Vision, Graphics, and Image Processing, 1989