Reconstructing 3D compact sets - Archive ouverte HAL Access content directly
Journal Articles Computational Geometry Year : 2011

Reconstructing 3D compact sets

(1) , (2)
1
2
Frédéric Cazals
  • Function : Author
  • PersonId : 905122

Abstract

Reconstructing a 3D shape from sample points is a central problem faced in medical applications, reverse engineering, natural sciences, cultural heritage projects, etc. While these applications motivated intense research on 3D surface reconstruction, the problem of reconstructing more general shapes hardly received any attention. This paper develops a reconstruction algorithm changing the 3D reconstruction paradigm as follows. First, the algorithm handles general shapes, i.e. compact sets, as opposed to surfaces. Under mild assumptions on the sampling of the compact set, the reconstruction is proved to be correct in terms of homotopy type. Second, the algorithm does not output a single reconstruction but a nested sequence of plausible reconstructions. Third, the algorithm accommodates topological persistence so as to select the most stable features only. Finally, in case of reconstruction failure, it allows the identification of under-sampled areas, so as to possibly fix the sampling. These key features are illustrated by experimental results on challenging datasets, and should prove instrumental in enhancing the processing of such datasets in the aforementioned applications.

Dates and versions

hal-00849819 , version 1 (01-08-2013)

Identifiers

Cite

Frédéric Cazals, David Cohen-Steiner. Reconstructing 3D compact sets. Computational Geometry, 2011, 45 (1-2), pp.1--13. ⟨10.1016/j.comgeo.2011.07.005⟩. ⟨hal-00849819⟩

Collections

INRIA INRIA2
110 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More