1 April 2007 Coarse-to-fine approximation of range images with bounded error adaptive triangular meshes
Author Affiliations +
A new technique for approximating range images with adaptive triangular meshes ensuring a user-defined approximation error is presented. This technique is based on an efficient coarse-to-fine refinement algorithm that avoids iterative optimization stages. The algorithm first maps the pixels of the given range image to 3D points defined in a curvature space. Those points are then tetrahedralized with a 3D Delaunay algorithm. Finally, an iterative process starts digging up the convex hull of the obtained tetrahedralization, progressively removing the triangles that do not fulfill the specified approximation error. This error is assessed in the original 3D space. The introduction of the aforementioned curvature space makes it possible for both convex and nonconvex object surfaces to be approximated with adaptive triangular meshes, improving thus the behavior of previous coarse-to-fine sculpturing techniques. The proposed technique is evaluated on real range images and compared to two simplification techniques that also ensure a user-defined approximation error: a fine-to-coarse approximation algorithm based on iterative optimization (Jade) and an optimization-free, fine-to-coarse algorithm (Simplification Envelopes).
© (2007) Society of Photo-Optical Instrumentation Engineers (SPIE)
Angel D. Sappa, Angel D. Sappa, Miguel Angel Garcia, Miguel Angel Garcia, "Coarse-to-fine approximation of range images with bounded error adaptive triangular meshes," Journal of Electronic Imaging 16(2), 023010 (1 April 2007). https://doi.org/10.1117/1.2731824


Back to Top