Localized homology

Computational Geometry - Tập 41 - Trang 126-148 - 2008
Afra Zomorodian1, Gunnar Carlsson2
1Department of Computer Science, Dartmouth College, Hanover, NH, USA
2Department of Mathematics, Stanford University, Stanford, CA, USA

Tài liệu tham khảo

Apaydin, 2003, Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion, Journal of Computational Biology, 10, 257, 10.1089/10665270360688011 Austern, 1998 Bentley, 1975, Multidimensional search trees used for associative searching, Communication of ACM, 18, 509, 10.1145/361002.361007 Brown, 1982, Cohomology of Groups, vol. 87 Carlsson, 2008, On the local behavior of spaces of natural images, International Journal of Computer Vision, 76, 1, 10.1007/s11263-007-0056-x Carlsson, 2005, Persistence barcodes for shapes, International Journal of Shape Modeling, 11, 149, 10.1142/S0218654305000761 Colin de Verdière, 2005, Optimal system of loops on an orientable surface, Discrete & Computational Geometry, 33, 507, 10.1007/s00454-004-1150-2 Curtis, 1971, Simplicial homotopy theory, Advances in Mathematics, 6, 107, 10.1016/0001-8708(71)90015-6 Edelsbrunner, 2002, Topological persistence and simplification, Discrete & Computational Geometry, 28, 511, 10.1007/s00454-002-2885-2 Edelsbrunner, 2003, Computing linking numbers in a filtration, Homology, Homotopy and Applications, 5, 19, 10.4310/HHA.2003.v5.n2.a2 J. Erickson, Personal communication Erickson, 2004, Optimally cutting a surface into a disk, Discrete & Computational Geometry, 31, 37, 10.1007/s00454-003-2948-z J. Erickson, K. Whittlesey, Greedy optimal homotopy and homology generators, in: Proc. ACM–SIAM Symposium on Discrete Algorithms 2005, pp. 1038–1046 Q. Fang, J. Gao, L.J. Guibas, Locating and bypassing routing holes in sensor networks, in: IEEE INFOCOM, 2004, pp. 2458–2468 D. Freedman, C. Chen, Measuring and localizing homology classes, 2007, Manuscript Greenberg, 1981, Algebraic Topology: A First Course, vol. 58 I. Guskov, Z. Wood, Topological noise removal, in: Graphics Interface, 2001, 19–26 Hatcher, 2002 Ito, 1987 Kaczynski, 2004 F. Lazarus, M. Pocchiola, G. Vegter, A. Verroust, Computing a canonical polygonal schema of an orientable triangulated surface, in: Proc. ACM Symposium on Computational Geometry, 2001, pp. 80–89 M. Levoy, K. Pulli, B. Curless, S. Rusinkiewicz, D. Koller, L. Pereira, M. Ginzton, S. Anderson, J. Davis, J. Ginsberg, J. Shade, D. Fulk, The digital Michelangelo project: 3D scanning of large statues, in: Proc. SIGGRAPH, 2000, pp. 131–144 May, 1967 Munkres, 1975 Munkres, 1984 B. Naylor, J. Amanatides, W. Thibault, Merging BSP trees yield polyhedral modeling results, in: Proc. SIGGRAPH, 1990, pp. 115–124 Segal, 1968, Classifying spaces and spectral sequences, Publications Mathémathiques de l'Institut des Hautes Études Scientifiques, 34, 105, 10.1007/BF02684591 G. Vegter, C.K. Yap, Computational complexity of combinatorial surfaces, in: Proc. ACM Symposium on Computational Geometry, 1990, pp. 102–111 Wood, 2004, Removing excess topology from isosurfaces, ACM Transactions on Graphics, 23, 190, 10.1145/990002.990007 Zomorodian, 2005 Zomorodian, 2005, Computing persistent homology, Discrete & Computational Geometry, 33, 249, 10.1007/s00454-004-1146-y