In this paper, we propose a general tridimensional reconstruction algorithm
of range and volumetric images, based on deformable simplex meshes. Simple
x meshes are topologically dual of triangulations and have the advantage of
permitting smooth deformations in a simple and efficient manner. Our recon
struction algorithm can handle surfaces without any restriction on their sh
ape or topology. The different tasks performed during the reconstruction in
clude the segmentation of given objects in the scene, the extrapolation of
missing data, and the control of smoothness, density, and geometric quality
of the reconstructed meshes. The reconstruction takes place in two stages.
First, the initialization stage creates a simplex mesh in the vicinity of
the data model either manually or using an automatic procedure. Then, after
a few iterations, the mesh topology can be modified by creating holes or b
y increasing its genus. Finally, an iterative refinement algorithm decrease
s the distance of the mesh from the data while preserving high geometric an
d topological quality. Several reconstruction examples are provided with qu
antitative and qualitative results.