Regular and irregular multi-resolution terrain models: a comparison
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Representing Vertex-Based Simplicial Multi-complexes
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Representing vertex-based simplicial multi-complexes
Digital and image geometry
Selective Refinement Queries for Volume Visualization of Unstructured Tetrahedral Meshes
IEEE Transactions on Visualization and Computer Graphics
Geometry-guided computation of 3D electrostatics for large biomolecules
Computer Aided Geometric Design - Special issue: Applications of geometric modeling in the life sciences
Modeling and Visualization Approaches for Time-Varying Volumetric Data
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Geometry-guided computation of 3D electrostatics for large biomolecules
Computer Aided Geometric Design - Special issue: Applications of geometric modeling in the life sciences
Algorithms for the physical rendering and assembly of octree models
Computer-Aided Design
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
SIAM Journal on Scientific Computing
| Hi-index | 0.00 |
Techniques are presented for moving between adjacent tetrahedra in a tetrahedral mesh. The tetrahedra result from a recursive decomposition of a cube into six initial congruent tetrahedra. A new technique is presented for labeling the triangular faces. The labeling enables the implementation of a binary-like decomposition of each tetrahedron which is represented using a pointerless representation. Outlines of algorithms are given for traversing adjacent triangular faces of equal size in constant time.