Solid representation and operation using extended octrees
ACM Transactions on Graphics (TOG)
Proceedings of the conference on Visualization '00
Optimizing 3D triangulations using discrete curvature analysis
Mathematical Methods for Curves and Surfaces
An Evaluation of Implicit Surface Tilers
IEEE Computer Graphics and Applications
Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data
MICCAI '98 Proceedings of the First International Conference on Medical Image Computing and Computer-Assisted Intervention
Modeling and Visualizing Volumetric and Surface-on-Surface Data
Focus on Scientific Visualization
Tools for Triangulations and Tetrahedrizations
Scientific Visualization, Overviews, Methodologies, and Techniques
Hierarchical isosurface segmentation based on discrete curvature
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
VIS '04 Proceedings of the conference on Visualization '04
Surface Shading in the Cuberille Environment
IEEE Computer Graphics and Applications
IEEE Transactions on Visualization and Computer Graphics
| Hi-index | 0.00 |
We discuss the dual marching tetrahedra (DMT) method. The DMT can be viewed as a generalization of the classical cuberille method of Chen et al. to a tetrahedronal. The cuberille method produces a rendering of quadrilaterals comprising a surface that separates voxels deemed to be contained in an object of interest from those voxels not in the object. A cuberille is a region of 3D space partitioned into cubes. A tetrahedronal is a region of 3D space decomposed into tetrahedra. The DMT method generalizes the cubille method from cubes to tetrahedra and corrects a fundamental problem of the original cuberille method where separating surfaces are not necessarily manifolds. For binary segmented data, we propose a method for computing the location of vertices this is based upon the use of a minimal discrete norm curvature criterion. For applications where dependent function values are given at grid points, two alternative methods for computing vertex positions are discussed and compared. Examples are drawn from a variety of applications, including the Yes/No/Don't_Know data sets resulting from inconclusive segmentation processes and Well-Log data sets.