Approximation of isosurface in the Marching Cube: ambiguity problem
Author:
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 288-292
Abstract
The purpose of the article is the consideration of the problem of ambiguity over the faces arising in the Marching Cube algorithm. The article shows that for unambiguous choice of the sequence of the points of intersection of the isosurface with edges confining the face it is sufficient to sort them along one of the coordinates. It also presents the solution of this problem inside the cube. Graph theory methods are used to approximate the isosurface inside the cell.Keywords
This publication has 4 references indexed in Scilit:
- The asymptotic decider: resolving the ambiguity in marching cubes2002
- Topological considerations in isosurface generation extended abstractACM SIGGRAPH Computer Graphics, 1990
- Marching cubes: A high resolution 3D surface construction algorithm1987
- Data structure forsoft objectsThe Visual Computer, 1986