Approximating loops in a shortest homology basis from point data

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2010, Pages 166-175

  Dey, Tamal K ^a   Sun, Jian ^b   Wang, Yusu ^a  

^a The Ohio State University   (United States)

^b Princeton University   (United States)

Author keywords

Homology basis; Point cloud; Rips complex; Topology

Indexed keywords

COMPLEX TOPOLOGY; ENGINEERING APPLICATIONS; FINITE FIELDS; FUNDAMENTAL PROBLEM; GEOMETRIC ATTRIBUTES; POINT CLOUD; POINT DATA; POLYNOMIAL-TIME ALGORITHMS; SCIENTIFIC STUDIES; SIMPLICIAL COMPLEX; SMOOTH MANIFOLDS;

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; TOPOLOGY;

COMPUTATIONAL GEOMETRY;

EID: 77954938168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810959.1810989     Document Type: Conference Paper

References (26)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom. 22 (1999), 481-504.
2. M. Belkin, J. Sun, and Y. Wang. Discrete Laplace operator for meshed surfaces. 24th. Ann. Sympos. Comput. Geom. (2008), 278-287.
3. M. Bernstein, V. de Silva, J. Langford, and J. Tenenbaum. Graph approximations to geodesics on embedded manifolds. Tech Report, Dept. Psychology, Stanford University, USA, 2000. Available at http://isomap.stanford. edu/BdSLT.pdf.
4. J.-D. Boissonnat, L. J. Guibas, and S. Y. Oudot. Manifold reconstruction in arbitrary dimensions using witness complexes. Proc. 23rd Ann. Sympos. Comput. Geom. (2007), 194-203.
5. E. W. Chambers, J. Erickson, and A. Nayyeri. Homology flows, cohomology cuts. 41st Ann. ACM Sympos. Theory Comput. (2009), 273-282.
6. E. W. Chambers, J. Erickson, and A. Nayyeri. Minimum cuts and shortest homologous cycles. 25th Ann. Sympos. Comput. Geom. (2009), 377-385.
7. F. Chazal and A. Lieutier. Topology guaranteeing manifold reconstruction using distance function to noisy data. Proc. 22nd Ann. Sympos. Comput. Geom. (2006), 112-118.
8. F. Chazal and S. Oudot. Towards persistence-based reconstruction in Euclidean spaces. Proc. 24th Ann. Sympos. Comput. Geom. (2008), 232-241.
9. C. Chen and D. Freedman. Measuring and localizing homology classes. arXiv:0705.3061v2[cs.CG] (2007).
10. C. Chen and D. Freedman. Quantifying homology classes. Proc. 25th Ann. Sympos. Theoretical Aspects Comput. Sci. (2009), 168-190.
11. C. Chen and D. Freedman. Hardness results for homology localization. ACM/SIAM Sympos. Discrete Algorithms (2010), 1594-1604.
12. S.-W. Cheng, T. K. Dey, and E. A. Ramos. Manifold reconstruction from point samples. Proc. 16th Sympos. Discrete Algorithms (2005), 1018-1027.
13. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. Discrete Comput. Geom. 37 (2007), 103-120.
14. D. Cohen-Steiner, H. Edelsbrunner, and D. Morozov. Vinesand vineyards by updating persistence in linear time. Proc. 22nd Ann. Sympos. Comput. Geom. (2006), 119-134.
15. É. Colin de Verdière and J. Erickson. Tightening non-simple paths and cycles on surfaces. Proc. ACM-SIAM Sympos. Discrete Algorithms (2006), 192-201.
16. T. K. Dey, A. Hirani, and B. Krishnamoorthy. Optimal homologous cycles, total unimodularity, and linear programming. Proc. 42nd ACM Sympos. Theory Computing (2010), to appear.
17. T. K. Dey and K. Li. Cut locus and topology from surface point data. 25th Ann. Sympos. Comput. Geom.(2009), 125-134.
18. M. P. do Carmo. Riemannian geometry. Birkhäuser, Boston, 1992.
19. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom. 28 (2002), 511-533. (Pubitemid 36161396)
20. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. Proc. ACM-SIAM Sympos. Discrete Algorithms (2005), 1038-1046.
21. A. Hatcher. Algebraic Topology. Cambridge U. Press, New York, 2002.
22. I. T. Jollife. Principal Component Analysis. Springer series in statistics, Springer, NY, 2002.
23. J. Leray. Sur la forme des espaces topologiques et sur les points fixes des représentations. J. Math. Pure Appl. 24 (1945), 95-167.
24. P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete Comput. Geom. 39 (2008), 419-441.
25. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science 290 (2000), 2319-2323.
26. A. Zomorodian and G. Carlsson. Computing persistent homology. Discrete Comput. Geom. 33 (2005), 249-274.