A heuristic for short homology basis of digital objects
From MaRDI portal
Publication:6160788
Recommendations
Cites work
- \textsc{Phat} -- persistent homology algorithms toolbox
- Allowing cycles in discrete Morse theory
- Annotating simplices with a homology basis and its applications
- Approximating loops in a shortest homology basis from point data
- Clear and compress: computing persistent homology in chunks
- Computational homology
- Computational topology. An introduction
- Efficient algorithms for computing a minimal homology basis
- Greedy optimal homotopy and homology generators
- Hardness results for homology localization
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 7760193 (Why is no real title available?)
- Measuring and computing natural generators for homology groups
- Two measures for the homology groups of binary volumes
- Zigzag persistent homology in matrix multiplication time
Cited in
(3)
This page was built for publication: A heuristic for short homology basis of digital objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160788)