Measuring and computing natural generators for homology groups
From MaRDI portal
Publication:1037782
DOI10.1016/j.comgeo.2009.06.004zbMath1203.65041OpenAlexW2118382603MaRDI QIDQ1037782
Publication date: 16 November 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.06.004
stabilityhomologycomputational geometrypersistent homologycomputational topologyhomology basisfinite field linear algebra
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items (7)
A heuristic for short homology basis of digital objects ⋮ Hardness results for homology localization ⋮ Non total-unimodularity neutralized simplicial complexes ⋮ Structure on the top homology and related algorithms ⋮ Computational topology and the Unique Games Conjecture ⋮ Unnamed Item ⋮ Lexicographic optimal homologous chains and applications to point cloud triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extreme elevation on a 2-manifold
- Stability of persistence diagrams
- Localized homology
- Extending persistence using Poincaré and Lefschetz duality
- Homology computation by reduction of chain complexes
- Optimally cutting a surface into a disk
- Computing persistent homology
- Topological persistence and simplification
- Coverage in sensor networks via persistent homology
- Solving sparse linear equations over finite fields
- Topology for Computing
- Quantifying Homology Classes
- PERSISTENCE BARCODES FOR SHAPES
- Barcodes: The persistent topology of data
This page was built for publication: Measuring and computing natural generators for homology groups