Measuring and computing natural generators for homology groups

DOI10.1016/J.COMGEO.2009.06.004MaRDI QIDQ1037782zbMATH OpenOpenAlexFDO

Authors Chao Chen, Daniel Z. Freedman

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

zbMATH Keywords

persistent homologystabilitycomputational geometrycomputational topologyhomologyhomology basisfinite field linear algebra

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Recommendations

• Quantifying homology classes
• Annotating simplices with a homology basis and its applications
• Greedy optimal homotopy and homology generators
• Discrete Geometry for Computer Imagery
• Efficient algorithms for computing a minimal homology basis

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 5506200 (Why is no real title available?)
• scientific article; zbMATH DE number 5507818 (Why is no real title available?)
• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• Barcodes: The persistent topology of data
• Computing persistent homology
• Coverage in sensor networks via persistent homology
• Extending persistence using Poincaré and Lefschetz duality
• Extreme elevation on a 2-manifold
• Greedy optimal homotopy and homology generators
• Hardness results for homology localization
• Homology computation by reduction of chain complexes
• Introduction to algorithms
• Localized homology
• Optimally cutting a surface into a disk
• PERSISTENCE BARCODES FOR SHAPES
• Persistent homology -- a survey
• Persistent homology for kernels, images, and cokernels
• Quantifying homology classes
• Solving sparse linear equations over finite fields
• Stability of persistence diagrams
• Topological persistence and simplification
• Topology for Computing

Cited in

(12)

• Lexicographic optimal homologous chains and applications to point cloud triangulations
• Structure on the top homology and related algorithms
• Computational topology and the unique games conjecture
• A heuristic for short homology basis of digital objects
• Discrete Geometry for Computer Imagery
• Combinatorial optimization of cycles and bases
• Hardness results for homology localization
• Greedy optimal homotopy and homology generators
• Annotating simplices with a homology basis and its applications
• Global minimum cuts in surface embedded graphs
• Non total-unimodularity neutralized simplicial complexes
• Quantifying homology classes

This page was built for publication: Measuring and computing natural generators for homology groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037782)