The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
暂无分享,去创建一个
[1] Erik Brisson,et al. Representing geometric structures in d dimensions: topology and order , 1989, SCG '89.
[2] Afra Zomorodian,et al. The tidy set: a minimal simplicial set for computing homology of clique complexes , 2010, SCG.
[3] Tamal K. Dey,et al. Computing Topological Persistence for Simplicial Maps , 2012, SoCG.
[4] PASCAL LIENHARDT,et al. N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds , 1994, Int. J. Comput. Geom. Appl..
[5] Leonidas J. Guibas,et al. Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes , 2007, SCG '07.
[6] Herbert Edelsbrunner,et al. Computational Topology - an Introduction , 2009 .
[7] Robert Sedgewick,et al. Fast algorithms for sorting and searching strings , 1997, SODA '97.
[8] Kim Steenstrup Pedersen,et al. The Nonlinear Statistics of High-Contrast Patches in Natural Images , 2003, International Journal of Computer Vision.
[9] André Lieutier,et al. Efficient Data Structure for Representing and Simplifying Simplicial complexes in High Dimensions , 2012, Int. J. Comput. Geom. Appl..
[10] Steve Oudot,et al. Towards persistence-based reconstruction in euclidean spaces , 2007, SCG '08.
[11] André Lieutier,et al. Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes , 2013, Comput. Geom..
[12] E. Coutsias,et al. Topology of cyclo-octane energy landscape. , 2010, The Journal of chemical physics.
[13] Vin de Silva,et al. On the Local Behavior of Spaces of Natural Images , 2007, International Journal of Computer Vision.
[14] Sanjoy Dasgupta,et al. Random projection trees and low dimensional manifolds , 2008, STOC.
[15] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[16] Erik Brisson,et al. Representing geometric structures ind dimensions: Topology and order , 1993, Discret. Comput. Geom..
[17] Jean-Daniel Boissonnat,et al. The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology , 2013, ESA.
[18] Elke Achtert,et al. Efficient reverse k-nearest neighbor search in arbitrary metric spaces , 2006, SIGMOD Conference.
[19] Gunnar E. Carlsson,et al. Topological estimation using witness complexes , 2004, PBG.