Approximation of isosurface in the marching cube: ambiguity problem

Authors:
Sergey V. Matveyev
Affiliations:
Institute for High Energy Physics, Protvino, Moscow Region, Russia
Venue:
VIS '94 Proceedings of the conference on Visualization '94
Year:
1994

Citing 5
Cited 3

Data structures for personal computers

Data structures for personal computers
Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Triangulation of scattered data in 3D space

Computer-Aided Design
Topological considerations in isosurface generation extended abstract

VVS '90 Proceedings of the 1990 workshop on Volume visualization
The asymptotic decider: resolving the ambiguity in marching cubes

VIS '91 Proceedings of the 2nd conference on Visualization '91

View dependent isosurface extraction

Proceedings of the conference on Visualization '98
Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing

IEEE Transactions on Visualization and Computer Graphics
A hierarchical sampling approach for polygonizing variational implicit surfaces

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of the present 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. The graph theory methods are used to approximate the isosurface inside the cell.