TY - GEN
T1 - Manifold reconstruction in arbitrary dimensions using witness complexes
AU - Boissonnat, Jean Daniel
AU - Guibas, Leonidas J.
AU - Oudot, Steve Y.
PY - 2007/10/22
Y1 - 2007/10/22
N2 - It is a well-established fact that the witness complex is closelyrelated to the restricted Delaunay triangulation in lowdimensions. Specifically, it has been proved that the witness complexcoincides with the restricted Delaunay triangulation on curves, and isstill a subset of it on surfaces, under mild samplingassumptions. Unfortunately, these results do not extend tohigher-dimensional manifolds, even under stronger samplingconditions. In this paper, we show how the sets of witnesses andlandmarks can be enriched, so that the nice relations that existbetween both complexes still hold on higher-dimensional manifolds. Wealso use our structural results to devise an algorithm thatreconstructs manifolds of any arbitrary dimension or co-dimension atdifferent scales. The algorithm combines a farthest-point refinementscheme with a vertex pumping strategy. It is very simple conceptually,and it does not require the input point sample W to be sparse. Itstime complexity is bounded by c(d) |W| 2, where c(d) is a constantdepending solely on the dimension d of the ambient space.
AB - It is a well-established fact that the witness complex is closelyrelated to the restricted Delaunay triangulation in lowdimensions. Specifically, it has been proved that the witness complexcoincides with the restricted Delaunay triangulation on curves, and isstill a subset of it on surfaces, under mild samplingassumptions. Unfortunately, these results do not extend tohigher-dimensional manifolds, even under stronger samplingconditions. In this paper, we show how the sets of witnesses andlandmarks can be enriched, so that the nice relations that existbetween both complexes still hold on higher-dimensional manifolds. Wealso use our structural results to devise an algorithm thatreconstructs manifolds of any arbitrary dimension or co-dimension atdifferent scales. The algorithm combines a farthest-point refinementscheme with a vertex pumping strategy. It is very simple conceptually,and it does not require the input point sample W to be sparse. Itstime complexity is bounded by c(d) |W| 2, where c(d) is a constantdepending solely on the dimension d of the ambient space.
KW - Manifold reconstruction
KW - Restricted Delaunay triangulation
KW - Sampling conditions
KW - Witness complex
UR - https://www.scopus.com/pages/publications/35348871002
U2 - 10.1145/1247069.1247106
DO - 10.1145/1247069.1247106
M3 - Conference contribution
AN - SCOPUS:35348871002
SN - 1595937056
SN - 9781595937056
T3 - Proceedings of the Annual Symposium on Computational Geometry
SP - 194
EP - 203
BT - Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07
T2 - 23rd Annual Symposium on Computational Geometry, SCG'07
Y2 - 6 June 2007 through 8 June 2007
ER -