Title :
Constant-time neighbor finding in hierarchical tetrahedral meshes
Author :
Lee, Michael ; De Floriani, Leila ; Samet, Hanan
Author_Institution :
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
Abstract :
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
Keywords :
computational geometry; adjacent tetrahedra; adjacent triangular face traversal; binary-like decomposition; constant-time neighbor finding; cube; hierarchical tetrahedral meshes; initial congruent tetrahedra; pointerless representation; recursive decomposition; triangular face labelling; Acceleration; Automation; Biomedical imaging; Computer science; Data mining; Data visualization; Educational institutions; Finite element methods; Image analysis; Labeling;
Conference_Titel :
Shape Modeling and Applications, SMI 2001 International Conference on.
Conference_Location :
Genova
Print_ISBN :
0-7695-0853-7
DOI :
10.1109/SMA.2001.923400
