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.
|Name||IEEE ICPR Proceedings Series|
|Conference||International Conference on Pattern Recognition|
|Period||20/08/06 → 24/08/06|