Published 2009
| Version v1
Journal article
Manifold Reconstruction in Arbitrary Dimensions using Witness Complexes
Contributors
Others:
- Geometric computing (GEOMETRICA) ; Centre Inria d'Université Côte d'Azur (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay ; Institut National de Recherche en Informatique et en Automatique (Inria)
- Geometric Computation Group [Stanford] ; Computer Science Department [Stanford] ; Stanford University-Stanford University
- NSF grants FRG-0354543 and ITR-0205671; NIH grant GM-072970; DARPA grant 32905
- European Project:
Description
It is a well-established fact that the witness complex is closely related to the restricted Delaunay triangulation in low dimensions. Specifically, it has been proved that the witness complex coincides with the restricted Delaunay triangulation on curves, and is still a subset of it on surfaces, under mild sampling conditions. In this paper, we prove that these results do not extend to higher-dimensional manifolds, even under strong sampling conditions such as uniform point density. On the positive side, we show how the sets of witnesses and landmarks can be enriched, so that the nice relations that exist between restricted Delaunay triangulation and witness complex hold on higher-dimensional manifolds as well. We derive from our structural results an algorithm that reconstructs manifolds of any arbitrary dimension or co-dimension at different scales. The algorithm combines a farthest-point refinement scheme with a vertex pumping strategy. It is very simple conceptually, and it does not require the input point sample to be sparse. Its running time is bounded by c(d)n2, where n is the size of the input point cloud, and c(d) is a constant depending solely (yet exponentially) on the dimension d of the ambient space. Although this running time makes our reconstruction algorithm rather theoretical, recent work has shown that a variant of our approach can be made tractable in arbitrary dimensions, by building upon the results of this paper.
Abstract
A preliminary version of this paper has been presented at the ACM Symp. on Computational Geometry 2007Abstract
International audienceAdditional details
Identifiers
- URL
- https://hal.science/hal-00488434
- URN
- urn:oai:HAL:hal-00488434v1
Origin repository
- Origin repository
- UNICA