Skip to Main content Skip to Navigation

Manifold Reconstruction using Tangential Delaunay Complexes

Jean-Daniel Boissonnat 1 Arijit Ghosh 1, *
* Corresponding author
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : We give a provably correct algorithm to reconstruct a $k$-dimensional manifold embedded in $d$-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unknown manifold. Our approach is based on two main ideas~: the notion of tangential Delaunay complex, and the technique of sliver removal by weighting the sample points. Differently from previous methods, we do not construct any subdivision of the embedding $d$-dimensional space. As a result, the running time of our algorithm depends only linearly on the extrinsic dimension $d$ while it depends quadratically on the size of the input sample, and exponentially on the intrinsic dimension $k$. To the best of our knowledge, this is the first certified algorithm for manifold reconstruction whose complexity depends linearly on the ambient dimension. We also prove that for a dense enough sample the output of our algorithm is isotopic to the manifold and a close geometric approximation of the manifold.
Document type :
Complete list of metadata
Contributor : Arijit Ghosh Connect in order to contact the contributor
Submitted on : Thursday, December 10, 2009 - 1:49:07 PM
Last modification on : Friday, February 6, 2015 - 1:03:57 PM
Long-term archiving on: : Thursday, October 18, 2012 - 10:36:12 AM


Files produced by the author(s)


  • HAL Id : inria-00440337, version 1



Jean-Daniel Boissonnat, Arijit Ghosh. Manifold Reconstruction using Tangential Delaunay Complexes. [Research Report] RR-7142, 2009. ⟨inria-00440337v1⟩



Les métriques sont temporairement indisponibles