TY - GEN
T1 - Triangular mesh generation of octrees of non-convex 3D objects
AU - Shin, Dongjoe
AU - Tjahjadi, Tardi
PY - 2006/9/18
Y1 - 2006/9/18
N2 - A general surface-generating algorithm, the marching cube, produces triangular meshes from octants where the vertices of octants are clearly classified into either inside or outside the object. However, the algorithm is ambiguous for octrees corresponding to non-convex objects generated using a shape from silhouette technique. This paper presents a methodology which involves Delaunay triangulation to generate surface meshes for such octrees. Since the general 3D Delaunay triangulation creates 3D convex hull which consists of tetrahedron meshes, we propose a method which applies the Delaunay algorithm locally in order to deal with non-convex objects. The proposed method first slices an octree and detects the clusters in each slice. All clusters between adjacent slices are linked based on a 3D probability density cube. The Delaunay algorithm is then applied to locally-linked clusters. Finally the accumulation of triangular meshes forms a final non-convex surface mesh.
AB - A general surface-generating algorithm, the marching cube, produces triangular meshes from octants where the vertices of octants are clearly classified into either inside or outside the object. However, the algorithm is ambiguous for octrees corresponding to non-convex objects generated using a shape from silhouette technique. This paper presents a methodology which involves Delaunay triangulation to generate surface meshes for such octrees. Since the general 3D Delaunay triangulation creates 3D convex hull which consists of tetrahedron meshes, we propose a method which applies the Delaunay algorithm locally in order to deal with non-convex objects. The proposed method first slices an octree and detects the clusters in each slice. All clusters between adjacent slices are linked based on a 3D probability density cube. The Delaunay algorithm is then applied to locally-linked clusters. Finally the accumulation of triangular meshes forms a final non-convex surface mesh.
U2 - 10.1109/ICPR.2006.1137
DO - 10.1109/ICPR.2006.1137
M3 - Conference contribution
SN - 0-7695-2521-0
T3 - IEEE ICPR Proceedings Series
SP - 950
EP - 953
BT - 18th International Conference on Pattern Recognition (ICPR'06)
PB - IEEE
T2 - International Conference on Pattern Recognition
Y2 - 20 August 2006 through 24 August 2006
ER -