Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
On generating topologically consistent isosurfaces from uniform samples
The Visual Computer: International Journal of Computer Graphics
VIS '97 Proceedings of the 8th conference on Visualization '97
Interval volume tetrahedrization
VIS '97 Proceedings of the 8th conference on Visualization '97
Simplicial subdivisions and sampling artifacts
Proceedings of the conference on Visualization '01
Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing
IEEE Transactions on Visualization and Computer Graphics
Computing contour trees in all dimensions
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Path seeds and flexible isosurfaces using topology for exploratory visualization
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
Morse-smale complexes for piecewise linear 3-manifolds
Proceedings of the nineteenth annual symposium on Computational geometry
Optimal Accurate Minkowski Sum Approximation of Polyhedral Models
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
| Hi-index | 0.00 |
We describe a method to decompose a cube with trilinear interpolation into a set of tetrahedra with linear interpolation, where isosurface topology is preserved during decomposition for all isovalues. This method is useful for converting from a rectilinear grid into a tetrahedral grid in scalar data with topological correctness. We apply our method to topologically and geometrically accurate isosurface extraction.