Surface Models and the Resolution of N -Dimensional Cell Ambiguity

Publisher Summary This chapter describes surface models and the resolution of N-dimensional cell ambiguity. The representation of n-dimensional continuous surfaces often employs a discrete lattice of n-dimensional cube cells. For instance, the marching cubes method locates the surface lying between adjacent vertices of the n-cube edges in which the cell vertices represent discrete sample values. The volume's surface exists at a point of zero value—it intersects any cube edge whose vertex values have opposing signs. Ambiguities occur in the cells whose vertex sets show many sign alternations. Geometrically, the surface intersects one face of the n-cube through each of its four edges. It is these special cases that engender the need for resolution as a central concern in surface modeling. This chapter reviews and illustrates the disambiguation strategies described in the literature. It highlights that in an ideal surface algorithm, the features of the surface geometry should match those of the underlying surface. In particular, if the original surface is continuous, the representational model must preserve this continuity. The chapter also reviews disambiguation techniques that require the computation of additional values or vertices for the decision.

[1]  Doug Moore,et al.  Understanding Simploids , 1992, Graphics Gems III.

[2]  J. Wilhelms,et al.  Topological considerations in isosurface generation extended abstract , 1990, SIGGRAPH 1990.

[3]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.

[4]  Jules Bloomenthal,et al.  An Implicit Surface Polygonizer , 1994, Graphics Gems.

[5]  Joe Warren,et al.  Compact Isocontours from sampled Data , 1992, Graphics Gems III.

[6]  Paul Ning,et al.  An evaluation of implicit surface tilers , 1993, IEEE Computer Graphics and Applications.

[7]  Robert L. Cook,et al.  The Reyes image rendering architecture , 1987, SIGGRAPH.

[8]  Steve Hill Tri-linear Interpolation , 1994, Graphics Gems.

[9]  Doug Moore Subdividing Simplices , 1992, Graphics Gems III.

[10]  Cornelia Zahlten Piecewise Linear Approximation of Isovalued Surfaces , 1992 .

[11]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[12]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[13]  Gesualdo Le Moli,et al.  Automatic contour map , 1969, CACM.

[14]  W. Lorensen,et al.  Two algorithms for the three-dimensional reconstruction of tomograms. , 1988, Medical physics.