论文信息 - An algorithm for calculating top-dimensional bounding chains

An algorithm for calculating top-dimensional bounding chains

We describe the Coefficient-Flow algorithm for calculating the bounding chain of an (n-1)-boundary on an n-manifold-like simplicial complex S. We prove its correctness and show that it has a comput ...

Danica Kragic | J. Frederico Carvalho | Mikael Vejdemo-Johansson | Florian T. Pokorny

[1] Florian T. Pokorny,et al. Topological trajectory classification with filtrations of simplicial complexes and persistent homology , 2016, Int. J. Robotics Res..

[2] Jean-Daniel Boissonnat,et al. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes , 2012, Algorithmica.

[3] A. Davie,et al. Improved bound for complexity of matrix multiplication , 2013, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.

[4] Roberto Tamassia,et al. Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[5] R. Forman. Morse Theory for Cell Complexes , 1998 .

[6] Erin W. Chambers,et al. Minimum cuts and shortest homologous cycles , 2009, SCG '09.

[7] Erin W. Chambers,et al. Computing Minimum Area Homologies , 2015, Comput. Graph. Forum.

[8] Enrico Bertolazzi,et al. Efficient Construction of 2-Chains with a Prescribed Boundary , 2017, SIAM J. Numer. Anal..

[9] Tamal K. Dey,et al. Optimal Homologous Cycles, Total Unimodularity, and Linear Programming , 2011, SIAM J. Comput..

[10] Herbert Edelsbrunner,et al. Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11] Chao Chen,et al. Hardness Results for Homology Localization , 2010, SODA '10.

[12] Erin W. Chambers,et al. Measuring similarity between curves on 2-manifolds via homotopy area , 2013, SoCG '13.