The tidy set: A minimal simplicial set for computing homology of clique complexes

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2010, Pages 257-266

  Zomorodian, Afra ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

Computational topology; Simplicial set; Vietoris rips complex; Witness complex

Indexed keywords

COMPUTATIONAL TOPOLOGY; KEY FEATURE; ORDERS OF MAGNITUDE; SIMPLICIAL COMPLEX; SMALL MEMORY REQUIREMENTS; TOPOLOGICAL DATA ANALYSIS;

DATA REDUCTION; TOPOLOGY;

COMPUTATIONAL GEOMETRY;

EID: 77954929689     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810959.1811004     Document Type: Conference Paper

References (34)

1. Barmak, J., and Minian, E. Strong homotopy types, nerves and collapses, 2009. arXiv:0907.2954v1 [math.GT].
2. Carlsson, G., Ishkhanov, T., de Silva, V., and Zomorodian, A. On the local behavior of spaces of natural images. International Journal of Computer Vision 76, 1 (2008), 1-12.
3. Cazals, F., and Karande, C. Reporting maximal cliques: new insights into an old problem. Research Report 5642, INRIA, 2005.
4. CHom P: Computational Homology Project. http://chomp.rutgers.edu.
5. Civan, Y., and Yalçin, E. Linear colorings of simplicial complexes and collapsing. Journal of Combinatorial Theory Series A 114, 7 (2007), 1315-1331.
6. Collins, A., Zomorodian, A., Carlsson, G., and Guibas, L. A barcode shape descriptor for curve point cloud data. Computers and Graphics 28, 6 (2004), 881-894.
7. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. Introduction to Algorithms, third ed. The MIT Press, Cambridge, MA, 2009.
8. Curtis, E. B. Simplicial homotopy theory. Advances in Mathematics 6 (1971), 107-209.
9. de Silva, V., and Carlsson, G. Topological estimation using witness complexes. In Proc. IEEE/Eurographics Symposium on Point-Based Graphics (2004), pp. 157-166.
10. Edelsbrunner, H., and Mücke, E. P. Three-dimensional alpha shapes. ACM Transactions on Graphics 13 (1994), 43-72.
11. Eilenberg, S., and Zilber, J. A. Semi-simplicial complexes and singular homology. Annals of Mathematics 51, 3 (1950), 499-513.
12. Giesen, J., and John, M. The flow complex: A data structure for geometric modeling. In Proc. Symposium on Discrete Algorithms (2003), pp. 285-294.
13. Goerss, P. G., and Jardine, J. F. Simplicial homotopy theory, vol. 174 of Progress in Mathematics. Birkhäuser-Verlag, Basel, Switzerland, 1999.
14. Gromov, M. Hyperbolic groups. In Essays in Group Theory, S. Gersten, Ed. Springer-Verlag, New York, NY, 1987, pp. 75-263.
15. Hatcher, A. Algebraic Topology. Cambridge University Press, New York, NY, 2002. http://www.math.cornell.edu/~hatcher/AT/ATpage.html.
16. Kaczynski, T., Mischaikow, K., and Mrozek, M. Computational Homology. Springer-Verlag, New York, NY, 2004.
17. Kasson, P. M., Zomorodian, A., Park, S., Singhal, N., Guibas, L. J., and Pande, V. S. Persistent voids: a new structural metric for membrane fusion. Bioinformatics 23, 14 (2007), 1753-1759.
18. Kozlov, D. Combinatorial Algebraic Topology. Springer-Verlag, New York, NY, 2008.
19. Matoušek, J. LC reductions yield isomorphic simplicial complexes. Contributions to Discrete Mathematics 3, 2 (2008), 37-39.
20. May, J. P. Simplicial Objects in Algebraic Topology. D. Van Nostrand Co., Inc., Princeton, NJ, 1967.
21. Moon, J. W., and Moser, L. On cliques in graphs. Israel Journal of Mathematics 3, 1 (1965), 23-28.
22. Mrozek, M., Pilarczyk, P., and Żelazna, N. Homology algorithm based on acyclic subspace. Computers and Mathematics with Applications 55, 11 (2008), 2395-2412.
23. Munkres, J. R. Elements of Algebraic Topology. Addison-Wesley, Reading, MA, 1984.
24. Perry, P. Application of simplicial sets to computational topology. Senior thesis, Stanford University, 2003.
25. Pilarczyk, P. Computer assisted method for proving existence of periodic orbits. Topological Methods in Nonlinear Analysis 13 (1999), 365-377.
26. Sexton, H., and Johansson, M. V. JPlex, 2009. http://comptop.stanford. edu/programs/jplex/.
27. Siek, J., Lee, L.-Q., and Lumsdaine, A. The Boost Graph Library: user guide and reference manual. Pearson Education, Inc., Upper Saddle River, NJ, 2002.
28. Storjohann, A. Near optimal algorithms for computing Smith normal forms of integer matrices. In Proc. International Conference on Symbolic and Algebraic Computation (1996), pp. 267-274.
29. Whitehead, J. H. C. Simplicial spaces, nuclei, and m-groups. Proceedings of the London Mathematical Society s2-45, 1 (1939), 243-327.
30. Yellin, D. M. Algorithms for subset testing and finding maximal sets. In Proc. ACM-SIAM Symposium on Discrete Algorithms (1992), pp. 386-392.
31. Zomorodian, A. Computational topology. In Algorithms and Theory of Computation Handbook, M. Atallah and M. Blanton, Eds., second ed., vol. 2. Chapman & Hall/CRC Press, Boca Raton, FL, 2010, ch. 3.
32. Zomorodian, A. Fast construction of the Vietoris-Rips complex. Computers & Graphics (2010). (To appear).
33. Zomorodian, A., and Carlsson, G. Computing persistent homology. Discrete & Computational Geometry 33, 2 (2005), 249-274.
34. Zomorodian, A., and Carlsson, G. Localized homology. Computational Geometry: Theory & Applications 41, 3 (2008), 126-148.