The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
暂无分享,去创建一个
[1] Vin de Silva,et al. Persistent Cohomology and Circular Coordinates , 2009, SCG '09.
[2] Primoz Skraba,et al. Zigzag persistent homology in matrix multiplication time , 2011, SoCG '11.
[3] Ulrich Bauer,et al. Clear and Compress: Computing Persistent Homology in Chunks , 2013, Topological Methods in Data Analysis and Visualization.
[4] Jean-Daniel Boissonnat,et al. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes , 2012, ESA.
[5] Chao Chen,et al. Persistent Homology Computation with a Twist , 2011 .
[6] Herbert Edelsbrunner,et al. Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[7] Dmitriy Morozov,et al. Dualities in persistent (co)homology , 2011, ArXiv.
[8] Chao Chen,et al. An output-sensitive algorithm for persistent homology , 2013, Comput. Geom..
[9] David Cohen-Steiner,et al. Stability of Persistence Diagrams , 2007, Discret. Comput. Geom..
[10] Herbert Edelsbrunner,et al. Computational Topology - an Introduction , 2009 .
[11] Afra Zomorodian,et al. Computing Persistent Homology , 2005, Discret. Comput. Geom..
[12] Chao Chen,et al. Annotating Simplices with a Homology Basis and Its Applications , 2011, SWAT.
[13] Tamal K. Dey,et al. Computing Topological Persistence for Simplicial Maps , 2012, SoCG.