Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 491-500

  Attali, Dominique ^a   Lieutier, André ^b   Salinas, David ^a  

^a GIPSA LAB   (France)

^b DASSAULT SYSTÈMES   (France)

Author keywords

ech complexes; Clique complexes; Collapses; Euclidean spaces; Homotopy equivalence; Metric spaces; Sampling; Shape reconstruction; Vietoris Rips complexes

Indexed keywords

CLIQUE COMPLEXES; COLLAPSES; EUCLIDEAN SPACES; HOMOTOPY EQUIVALENCE; METRIC SPACES; SHAPE RECONSTRUCTION; VIETORIS-RIPS COMPLEXES;

EQUIVALENCE CLASSES;

TOPOLOGY;

EID: 79960176416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998276     Document Type: Conference Paper

References (35)

1. N. Amenta, D. Attali, and O. Devillers. Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. In Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA'07), New-Orleans, Lousiana, USA, January 7-9 2007.
2. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete and Computational Geometry, 22(4):481-504, 1999.
3. N. Amenta, M. Bern, and D. Eppstein. The crust and the β-skeleton: Combinatorial curve reconstruction. Graphical Models and Image Processing, 60(2):125-135, 1998. (Pubitemid 128458198)
4. D. Attali. r-regular shape reconstruction from unorganized points. Computational Geometry: Theory and Applications, 10:239-247, 1998. (Pubitemid 128401866)
5. D. Attali and J.-D. Boissonnat. A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces. Discrete and Computational Geometry, 31(3):369-384, February 2004. (Pubitemid 38483687)
6. D. Attali, J.-D. Boissonnat, and A. Lieutier. Complexity of the Delaunay triangulation of points on surfaces: the smooth case. In 19th ACM Symposium on Computational Geometry, pages 201-210, San-Diego, California, USA, June 2003.
7. D. Attali and A. Lieutier. Reconstructing shapes with guarantees by unions of convex sets. In 26th Ann. Sympos. Comput. Geom., pages 344-353, Snowbird, Utah, June 13-16 2010.
8. D. Attali, A. Lieutier, and D. Salinas. Efficient Data Structure for Representing and Simplifying Simplicial Complexes in High Dimension. In Proc. 27th Ann. Sympos. Comput. Geom., Paris, France, June 13-15 2011.
9. J. A. Barmak and E. G. Minian. Strong homotopy types, nerves and collapses. Technical report, arXiv:0907.2954v1, 2009.
10. A. Bjorner. Topological methods. In Handbook of combinatorics (vol. 2), page 1850. MIT Press, 1996.
11. J. Boissonnat and F. Cazals. Smooth surface reconstruction via natural neighbour interpolation of distance functions. Computational Geometry: Theory and Applications, 22(1-3):185-203, 2002.
12. J. Boissonnat, O. Devillers, and S. Hornus. Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension. In Proceedings of the 25th annual symposium on Computational geometry, pages 208-216. ACM, 2009.
13. J. Boissonnat and A. Ghosh. Manifold reconstruction using tangential Delaunay complexes. In Proceedings of the 2010 annual symposium on Computational geometry, pages 324-333. ACM, 2010.
14. E. Chambers, V. de Silva, J. Erickson, and R. Ghrist. Vietoris-rips complexes of planar point sets. Discrete and Computational Geometry, pages 1-16, 2010.
15. F. Chazal, D. Cohen-Steiner, and A. Lieutier. A sampling theory for compact sets in Euclidean space. Discrete and Computational Geometry, 41(3):461-479, 2009.
16. F. Chazal and A. Lieutier. The λ-medial axis. Graphical Models, 67(4):304-331, 2005.
17. F. Chazal and A. Lieutier. Smooth Manifold Reconstruction from Noisy and Non Uniform Approximation with Guarantees. Computational Geometry: Theory and Applications, 40:156-170, 2008.
18. F. Chazal and S. Oudot. Towards persistence-based reconstruction in euclidean spaces. In Proc. ACM Symposium on Computational Geometry, pages 232-241, 2008.
19. V. De Silva. A weak characterisation of the Delaunay triangulation. Geometriae Dedicata, 135(1):39-64, 2008.
20. V. de Silva and R. Ghrist. Coverage in sensor networks via persistent homology. Algebraic & Geometric Topology, 7:339-358, 2007.
21. T. Dey. Curve and surface reconstruction: algorithms with mathematical analysis. Cambridge Univ Pr, 2007.
22. T. K. Dey, H. Edelsbrunner, and S. Guha. Computational topology. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics. AMS, Providence, 1999.
23. H. Edelsbrunner. The union of balls and its dual shape. In Proceedings of the ninth annual symposium on Computational geometry, pages 218-231. ACM, 1993.
24. H. Edelsbrunner and E. Mucke. Three-dimensional alpha shapes. In Proceedings of the 1992 workshop on Volume visualization, pages 75-82. ACM, 1992.
25. H. Edelsbrunner and N. Shah. Triangulating topological spaces. In International Journal of Computational Geometry and Applications, volume 7, pages 365-378. Citeseer, 1997.
26. M. Gromov, M. Katz, P. Pansu, and S. Semmes. Metric structures for Riemannian and non-Riemannian spaces. Birkhauser, 2006.
27. K. Grove. Critical point theory for distance functions. In Proc. of Symposia in Pure Mathematics, volume 54, pages 357-386, 1993.
28. J. Hausmann. On the Vietoris-Rips Complexes and a Cohomology Theory for Metric Spaces. In Prospects in topology: proceedings of a conference in honor of William Browder, page 175. Princeton Univ Pr, 1995.
29. J. Latschev. Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold. Archiv der Mathematik, 77(6):522-528, 2001. (Pubitemid 33402794)
30. A. Lieutier. Any open bounded subset of Rn has the same homotopy type as its medial axis. Computer-Aided Design, 36(11):1029-1046, 2004.
31. J. Munkres. Elements of algebraic topology. Perseus Books, 1993.
32. P. Niyogi, S. Smale, and S. Weinberger. Finding the Homology of Submanifolds with High Confidence from Random Samples. Discrete Computational Geometry, 39(1-3):419-441, 2008.
33. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer, editor, New Results and New Trends in Computer Science, volume 555, pages 359-370. Springer, 1991.
34. A. Zomorodian. Fast construction of the Vietoris-Rips complex. Computers & Graphics, 2010.
35. A. Zomorodian. The tidy set: a minimal simplicial set for computing homology of clique complexes. In Proceedings of ACM symposium of computational geometry, 2010.