Fast construction of the Vietoris-Rips complex

Computers and Graphics (Pergamon)

Volumn 34, Issue 3, 2010, Pages 263-271

  Zomorodian, Afra ^a  

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

Author keywords

Clique complex; Topological data analysis; Vietoris Rips complex

Indexed keywords

DATA HANDLING; INFORMATION ANALYSIS;

CLIQUE COMPLEX; HIGHER DIMENSIONS; POINT SET; SECOND PHASE; SURVEY METHODS; TOPOLOGICAL DATA ANALYSIS; TWO PHASE; VIETORIS-RIPS COMPLEX;

TOPOLOGY;

EID: 77955270465     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2010.03.007     Document Type: Conference Paper

References (39)

1. A. Andoni, and P. Indyk Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions Communications of the ACM 51 1 2008 117 122
2. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu An optimal algorithm for approximate nearest neighbor searching in fixed dimensions Journal of the ACM 45 6 1998 891 923
3. Boissonnat J-D, Devillers O, Hornus S. Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension. In: Proceedings of ACM symposium on computational geometry, 2009. p. 208-16.
4. C. Bron, and J. Kerbosch Algorithm 457: finding all cliques in an undirected graph Communications of the ACM 16 9 1973 575 577
5. G. Carlsson, T. Ishkhanov, V. de Silva, and A. Zomorodian On the local behavior of spaces of natural images International Journal of Computer Vision 76 1 2008 1 12
6. F. Cazals, J. Giesen, M. Pauly, and A. Zomorodian The conformal alpha shape filtration The Visual Computer 22 8 2006 531 540
7. Cazals F, Karande C. Reporting maximal cliques: new insights into an old problem. Research Report 5642, INRIA; 2005.
8. A. Collins, A. Zomorodian, G. Carlsson, and L. Guibas A barcode shape descriptor for curve point cloud data Computers and Graphics 28 6 2004 881 894
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to algorithms 3rd ed. 2009 The MIT Press Cambridge, MA
10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational geometry: algorithms and applications 2nd ed. 2000 Springer-Verlag New York
11. D. de Caen An upper bound on the sum of squares of degrees in a graph Discrete Mathematics 185 1998 245 248
12. de Silva V, Carlsson G. Topological estimation using witness complexes. In: Proceedings of IEEE/Eurographics symposium on point-based graphics, 2004. p. 157-66.
13. R.O. Duda, and P.E. Hart Pattern classification 2nd ed 2000 John Wiley & Sons Inc. New York, NY
14. H. Edelsbrunner, D. Letscher, and A. Zomorodian Topological persistence and simplification Discrete and Computational Geometry 28 4 2002 511 533 (Pubitemid 36161396)
15. H. Edelsbrunner, and E.P. Mcke Three-dimensional alpha shapes ACM Transactions on Graphics 13 1994 43 72
16. P. Erds, and A. Rnyi On random graphs, I Pulicationes Mathematicae (Debrecen) 6 1959 290 297
17. Friedman JH, Bentley JL, Finkel RA. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software 1977;209-26.
18. Giesen J, John M. The flow complex: a data structure for geometric modeling. In: Proceedings of symposium on discrete algorithms, 2003. p. 285-94.
19. M. Gromov Hyperbolic groups S. Gersten, Essays in group theory 1987 Springer-Verlag New York, NY 75 263
20. A. Hatcher Algebraic topology 2002 Cambridge University Press New York, NY
21. ISO/IEC. Digital compression and coding of continuous-tone still images: requirements and guidelines (10918-1), 1994.
22. M. Kahle Topology of random clique complexes Discrete Mathematics 309 2009 1658 1671
23. Karp RM. Reducibility among combinatorial problems. In: Complexity of computer computations (symposium proceedings). New York, NY: Plenum Press; 1972.
24. I. Koch Enumerating all connected maximal common subgraphs in two graphs Theoretical Computer Science 250 12 2001 1 30
25. D. Kozlov Combinatorial algebraic topology 2008 Springer-Verlag New York, NY
26. Lifshits Y. The homepage of nearest neighbors and similarity search, 2009. 〈 http://simsearch.yury.name/ 〉.
27. J.W. Moon, and L. Moser On cliques in graphs Israel Journal of Mathematics 3 1 1965 23 28
28. Mount DM, Arya S. ANN: a library for approximate nearest neighbor searching version 1.1.1, 2006. 〈 http://www.cs.umd.edu/∼mount/ANN/ 〉.
29. M.E. Muller A note on a method for generating points uniformly on n-dimensional spheres Communications of the ACM 2 4 1959 19 20
30. Perry P, de Silva V. PLEX 2.5: simplicial complexes in MATLAB, 2006. 〈 http://math.stanford.edu/comptop/programs/plex.html 〉.
31. K.H. Rosen Discrete mathematics and its applications 6th ed 2006 McGraw-Hill New York, NY
32. Sexton H, Johansson MV. JPlex, 2009. 〈 http://comptop.stanford.edu/ programs/jplex 〉
33. J. Siek, L.-Q. Lee, and A. Lumsdaine The boost graph library: user guide and reference manual 2002 Pearson Education Inc. Upper Saddle River, NJ
34. S. Tsukiama, M. Ide, H. Ariyoshi, and I. Shirakawa A new algorithm for generating all the maximal independent sets SIAM Journal on Computing 6 3 1977 505 517
35. L. Vietoris ber den hheren zusammenhang kompakter rume und eine klasse von zusammenhangstreuen abbildungen Mathematische Annalen 97 1 1927 454 472
36. Y.S. Yoon, and J.K. Kim A relationship between bounds on the sum of squares of degrees of a graph Journal of Applied Mathematics and Computing 21 12 2006
37. A. Zomorodian Computational topology M. Atallah, M. Blanton, Algorithms and theory of computation handbook vol. 2, 2nd ed. 2010 Chapman & Hall, CRC Press Boca Raton, FL 1 2 [chapter 3]
38. Zomorodian A. The tidy set: a minimal simplicial set for computing homology of clique complexes. In: Proceedings of ACM symposium of computational geometry, 2010, to appear.
39. A. Zomorodian, and G. Carlsson Computing persistent homology Discrete Computational Geometry 33 2 2005 249 274