Reeb graphs: Approximation and persistence

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 226-235

  Dey, Tamal K ^a   Wang, Yusu ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Approximation; Point cloud data; Reeb graphs; Topology

Indexed keywords

APPROXIMATION; CONNECTED COMPONENT; CONTINUOUS FUNCTIONS; EFFICIENT COMPUTATION; EXPECTED TIME; GRAPH STRUCTURES; LEVEL SET; NEAR-LINEAR TIME; ORIENTABLE; PIECEWISE LINEAR FUNCTIONS; POINT CLOUD DATA; POINT DATA; REAL VALUES; REEB GRAPH; SIMPLICIAL COMPLEX; SPLIT-AND-MERGE; TOPOLOGICAL SPACES;

ALGORITHMS; DATA REDUCTION; TOPOLOGY;

GRAPHIC METHODS;

EID: 79960155698     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998230     Document Type: Conference Paper

References (24)

1. M. Bernstein, V. de Silva, J. Lanford, and J. Tenenbaum. Graph pproximations to geodesics on embedded manifolds. Technical report, Dept. Psychology, Stanford University, USA, 2000.
2. S. Biasotti, D. Giorgi, M. Spagnuolo, and B. Falcidieno. Reeb graphs for shape analysis and applications. Theor. Comput. Sci., 392(1-3):5-22, 2008. (Pubitemid 351199935)
3. F. Chazal, L. J. Guibas, S. Oudot, and P. Skraba. Analysis of scalar fields over point cloud data. In Proc. 20th ACM-SIAM Sympos. Discrete Algorithms, pages 1021-1030, 2009.
4. F. Chazal, L. J. Guibas, S. Y. Oudot, and P. Skraba. Persistence-based clustering in Riemannian manifolds. Technical Report Research Report RR-6968, INRIA, June 2009.
5. F. Chazal and S. Oudot. Towards persistence-based reconstruction in Euclidean spaces. In Proc. 24th ACM Sympos. on Comput. Geom., pages 232-241, 2008.
6. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Extending persistence using Poincaré and Lefschetz duality. Foundations of Computational Mathematics, 9(1):79-103, 2009.
7. D. Cohen-Steiner, H. Edelsbrunner, and D. Morozov. Vines and vineyards by updating persistence in linear time. In Proc. 22nd Annu. Sympos. Comput. Geom., pages 119-126, 2006. (Pubitemid 44300779)
8. K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci. Loops in Reeb graphs of 2-manifolds. Discrete Comput. Geom., 32(2):231-244, 2004. (Pubitemid 39129966)
9. T. K. Dey. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge U. Press, New York, NY, USA, 2007.
10. T. K. Dey and K. Li. Cut locus and topology from surface point data. In Proc. 25th Annu. Sympos. Comput. Geom., pages 125-134, 2009.
11. T. K. Dey, J. Sun, and Y. Wang. Approximating loops in a shortest homology basis from point data. In Proc. 26th Annu. Sympos. Compu. Geom., pages 166-175, 2010.
12. H. Doraiswamy and V. Natarajan. Efficient output-sensitive construction of Reeb graphs. In Proc. 19th Internat. Sym. Alg. and Comput., pages 556-567, 2008.
13. H. Doraiswamy and V. Natarajan. Efficient algorithms for computing Reeb graphs. Computational Geometry: Theory and Applications, 42:606-616, 2009.
14. H. Edelsbrunner and J. Harer. Persistent homology - a survey. In J. E. Goodman, J. Pach, and R. Pollack, editors, Surveys on Discrete and Computational Geometry. Twenty Years Later, pages 257-282. Amer. Math. Soc., Providence, Rhode Island, 2008. Contemporary Mathematics 453.
15. H. Edelsbrunner, J. Harer, A. Mascarenhas, V. Pascucci, and J. Snoeyink. Time-varying Reeb graphs for continuous space-time data. Comput. Geom., 41(3):149-166, 2008.
16. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom., 28:511-533, 2002. (Pubitemid 36161396)
17. W. Harvey, R. Wenger, and Y. Wang. A randomized O(mlogm) time algorithm for computing Reeb graph of arbitrary simplicial complexes. In Proc. 26th Annu. Sympos. Compu. Geom., pages 267-276, 2010.
18. J.-C. Hausmann. On the Vietoris-Rips complexes and a cohomology theory for metric spaces. In Prospects in Topology: Proc. Conf. in Honour of William Browder, Ann. Math. Stud., 138, pages 175-188. Princeton Univ. Press, 1995.
19. J. R. Munkres. Elements of Algebraic Topology. Westview Press, 1996.
20. P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete Comput. Geom., 39:419-441, 2008.
21. V. Pascucci, G. Scorzelli, P.-T. Bremer, and A. Mascarenhas. Robust on-line computation of Reeb graphs: simplicity and speed. ACM Trans. Graph., 26(3):58, 2007.
22. G. Reeb. Sur les points singuliers d'une forme de Pfaff complètement intégrable ou d'une fonction numérique. Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences, 222:847-849, 1946.
23. Y. Shinagawa and T. L. Kunii. Constructing a Reeb graph automatically from cross sections. IEEE Comput. Graph. Appl., 11(6):44-51, 1991.
24. J. Tierny, A. Gyulassy, E. Simon, and V. Pascucci. Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees. IEEE Trans. Vis. Comput. Graph., 15(6):1177-1184, 2009.