Polyhedral approximation approach to molecular orbital graphics
Journal of Molecular Graphics
Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
Polygonization of implicit surfaces
Computer Aided Geometric Design
An efficient 3-D visualization technique for finite element models and other coarse volumes
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Guaranteed ray intersections with implicit surfaces
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Boundary and object labelling in three-dimensional images
Computer Vision, Graphics, and Image Processing
Octrees for faster isosurface generation
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Topological considerations in isosurface generation extended abstract
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Segmentation and surface-based modeling of objects in three-dimensional biomedical images
Segmentation and surface-based modeling of objects in three-dimensional biomedical images
Representation of Three-Dimensional Digital Images
ACM Computing Surveys (CSUR)
Optimal surface reconstruction from planar contours
Communications of the ACM
Re: additional reference to "marching cubes"
ACM SIGGRAPH Computer Graphics
V-buffer: visible volume rendering
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Conversion of complex contour line definitions into polygonal element mosaics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
ISOSRF—an algorithm for plotting Iso-valued surfaces of a function of three variables
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
The asymptotic decider: resolving the ambiguity in marching cubes
VIS '91 Proceedings of the 2nd conference on Visualization '91
Visualization in anthropology: reconstruction of human fossils from multiple pieces
VIS '92 Proceedings of the 3rd conference on Visualization '92
GADGET: goal-oriented application design guidance for modular visualization environments
VIS '97 Proceedings of the 8th conference on Visualization '97
Measuring volumetric coherence
ACM SIGGRAPH 98 Conference abstracts and applications
A Parallel Algorithm to Reconstruct Bounding Surfaces in 3D Images
The Journal of Supercomputing
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Topology preserving and controlled topology simplifying multiresolution isosurface extraction
Proceedings of the conference on Visualization '00
Advanced algorithmic approaches to medical image segmentation
Circular incident edge lists: a data structure for rendering complex unstructured grids
Proceedings of the conference on Visualization '01
Exploring scalar fields using critical isovalues
Proceedings of the conference on Visualization '02
BLIC: bi-level isosurface compression
Proceedings of the conference on Visualization '02
IEEE Transactions on Visualization and Computer Graphics
Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing
IEEE Transactions on Visualization and Computer Graphics
Surface Area Estimation of Digitized 3D Objects Using Local Computations
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Simplification and Repair of Polygonal Models Using Volumetric Techniques
IEEE Transactions on Visualization and Computer Graphics
Surface Reconstruction with Volume Preservation
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
Topological Landscapes: A Terrain Metaphor for Scientific Data
IEEE Transactions on Visualization and Computer Graphics
Isosurface extraction and interpretation on very large datasets in geophysics
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Fixing geometric errors on polygonal models: a survey
Journal of Computer Science and Technology
Preserving zeros in surface construction using marching cubes
Machine Graphics & Vision International Journal
Delaunay conforming iso-surface, skeleton extraction and noise removal
Computational Geometry: Theory and Applications
Extraction of crack-free isosurfaces from adaptive mesh refinement data
EGVISSYM'01 Proceedings of the 3rd Joint Eurographics - IEEE TCVG conference on Visualization
Technical Section: Practical considerations on Marching Cubes 33 topological correctness
Computers and Graphics
Hi-index | 0.00 |
A popular technique for rendition of isosurfaces in sampled data is to consider cells with sample points as corners and approximate the isosurface in each cell by one or more polygons whose vertices are obtained by interpolation of the sample data. That is, each polygon vertex is a point on a cell edge, between two adjacent sample points, where the function is estimated to equal the desired threshold value. The two sample points have values on opposite sides of the threshold, and the interpolated point is called an intersection point.When one cell face has an intersection point in each of its four edges, then the correct connection among intersection points becomes ambiguous. An incorrect connection can lead to erroneous topology in the rendered surface, and possible discontinuities. We show that disambiguation methods, to be at all accurate, need to consider sample values in the neighborhood outside the cell. This paper studies the problems of disambiguation, reports on some solutions, and presents some statistics on the occurrence of such ambiguities.A natural way to incorporate neighborhood information is through the use of calculated gradients at cell corners. They provide insight into the behavior of a function in well-understood ways. We introduce two gradient consistency heuristics that use calculated gradients at the corners of ambiguous faces, as well as the function values at those corners, to disambiguate at a reasonable computational cost. These methods give the correct topology on several examples that caused problems for other methods we examined.