Quantifying homology classes

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 169-180

  Chen, Chao ^a   Freedman, Daniel ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Computational geometry; Computational topology; Homology; Localization; Optimization; Persistent homology

Indexed keywords

OPTIMIZATION;

BETTI NUMBERS; COMPUTATIONAL TOPOLOGY; GREEDY ALGORITHMS; HARDNESS RESULT; HOMOLOGY; LOCALIZATION; PERSISTENT HOMOLOGY; SIMPLICIAL COMPLEX;

COMPUTATIONAL GEOMETRY;

EID: 45749139651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. P. K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang. Extreme elevation on a 2-manifold. Discrete & Computational Geometry, 36:553-572, 2006.
2. E. M. Arkin and R. Hassin. Minimum-diameter covering problems. Networks, 36(3):147-155, 2000.
3. G. Carlsson. Persistent homology and the analysis of high dimensional data. Symposium on the Geometry of Very Large Data Sets, Febrary 2005. Fields Institute for Research in Mathematical Sciences.
4. G. Carlsson, T. Ishkhanov, V. de Silva, and L. J. Guibas. Persistence barcodes for shapes. International Journal of Shape Modeling, 11(2):149-188, 2005.
5. C. Carner, M. Jin, X. Gu, and H. Qin. Topology-driven surface mappings with robust feature alignment. In IEEE Visualization, p. 69, 2005.
6. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. Discrete & Computational Geometry, 37:103-120, 2007.
7. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Extending persistent homology using Poincaré and Lefschetz duality. Foundations of Computational Mathematics, to appear.
8. D. Cohen-Steiner, H. Edelsbrunner, and D. Morozov. Vines and vineyards by updating persistence in linear time. In Symposium on Computational Geometry, pp. 119-126, 2006.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
10. V. de Silva and R. Ghrist. Coverage in sensor networks via persistent homology. Algebraic & Geometric Topology, 2006.
11. T. K. Dey, K. Li, and J. Sun. On computing handle and tunnel loops. In IEEE Proc. NASAGEM, 2007.
12. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete & Computational Geometry, 28(4):511-533, 2002.
13. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete & Computational Geometry, 31(1):37-59, 2004.
14. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. In SODA, pp. 1038-1046, 2005.
15. R. Ghrist. Barcodes: the persistent topology of data. Amer. Math. Soc Current Events Bulletin.
16. J. R. Munkres. Elements of Algebraic Topology. Addison-Wesley, Redwook City, California, 1984.
17. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. In Proc. 20th ACM Symposium on Theory of computing, pp. 229-234, New York, NY, USA, 1988. ACM Press.
18. D. H. Wiedemann. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, 32(1):54-62, 1986.
19. Z. J. Wood, H. Hoppe, M. Desbrun, and P. Schröder. Removing excess topology from isosurfaces. ACM Trans. Graph., 23(2):190-208, 2004.
20. A. Zomorodian and G. Carlsson. Computing persistent homology. Discrete & Computational Geometry, 33(2):249-274, 2005.
21. A. Zomorodian and G. Carlsson. Localized homology. In Shape Modeling International, pp. 189-198, 2007.