Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Area and volume coherence for efficient visualization of 3D scalar functions
VVS '90 Proceedings of the 1990 workshop on Volume visualization
A polygonal approximation to direct scalar volume rendering
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Octrees for faster isosurface generation
ACM Transactions on Graphics (TOG)
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
Multi-dimensional trees for controlled volume rendering and compression
VVS '94 Proceedings of the 1994 symposium on Volume visualization
Complex-valued contour meshing
Proceedings of the 7th conference on Visualization '96
Interval volume tetrahedrization
VIS '97 Proceedings of the 8th conference on Visualization '97
Extracting iso-valued features in 4-dimensional scalar fields
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Isosurface extraction in time-varying fields using a temporal hierarchical index tree
Proceedings of the conference on Visualization '98
Isosurface extraction in time-varying fields using a temporal branch-on-need tree (T-BON)
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Isosurfacing in higher dimensions
Proceedings of the conference on Visualization '00
Re: additional reference to "marching cubes"
ACM SIGGRAPH Computer Graphics
Consistent subdivision of convex polyhedra into tetrahedra
Journal of Graphics Tools
Volumetric Data Exploration Using Interval Volume
IEEE Transactions on Visualization and Computer Graphics
The asymptotic decider: resolving the ambiguity in marching cubes
VIS '91 Proceedings of the 2nd conference on Visualization '91
Rendering Implicit Flow Volumes
VIS '04 Proceedings of the conference on Visualization '04
Volume Interval Segmentation and Rendering
VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
A Conservative Front Tracking Method in N-Dimensions
Journal of Scientific Computing
Modeling and Visualization Approaches for Time-Varying Volumetric Data
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Physics-inspired topology changes for thin fluid features
ACM SIGGRAPH 2010 papers
Construction of 3D orthogonal cover of a digital object
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Surface volume estimation of digitized hyperplanes using weighted local configurations
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
Quality isosurface mesh generation using an extended marching cubes lookup table
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Abstract--We present an algorithm for constructing isosurfaces in any dimension. The input to the algorithm is a set of scalar values in a d-dimensional regular grid of (topological) hypercubes. The output is a set of (d-1)-dimensional simplices forming a piecewise linear approximation to the isosurface. The algorithm constructs the isosurface piecewise within each hypercube in the grid using the convex hull of an appropriate set of points. We prove that our algorithm correctly produces a triangulation of a (d-1)-manifold with boundary. In dimensions three and four, lookup tables with 2^8 and 2^{16} entries, respectively, can be used to speed the algorithm's running time. In three dimensions, this gives the popular Marching Cubes algorithm. We discuss applications of four-dimensional isosurface construction to time varying isosurfaces, interval volumes, and morphing.