Persistent homology computation using combinatorial map simplification

DOI10.1007/978-3-030-10828-1_3MaRDI QIDQ6085959zbMATH OpenFDO

Authors Guillaume Damiand, Rocío González-Díaz

Publication date 9 November 2023

Published in Computational Topology in Image Context (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-10828-1_3

zbMATH Keywords

2D combinatorial mapmesh simplificationpersistent homology computation

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computational aspects of digital topology (68U03)

Recommendations

• An output-sensitive algorithm for persistent homology
• Computing persistent homology
• An output-sensitive algorithm for persistent homology
• Computing persistent homology
• Morse theory for filtrations and efficient computation of persistent homology

Cited in

(11)

• Computing persistent homology
• Computational tools in weighted persistent homology
• Compression for \(2\)-parameter persistent homology
• An efficient algorithm for 1-dimensional (Persistent) path homology
• Efficient Computation of Persistent Homology for Cubical Data
• Persistent homology for hypergraphs and computational tools — A survey for users
• Combinatorial presentation of multidimensional persistent homology
• Essential Simplices in Persistent Homology and Subtle Admixture Detection
• Computing persistent homology
• Fast computation of persistent homology representatives with involuted persistent homology
• Slice, simplify and stitch: topology-preserving simplification scheme for massive voxel data

This page was built for publication: Persistent homology computation using combinatorial map simplification

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