Computing zigzag vineyard efficiently including expansions and contractions

DOI10.4230/LIPICS.SOCG.2024.49MaRDI QIDQ6895852zbMATH OpenFDO

Authors Tamal K. Dey, Tao Hou

Publication date 24 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2024.49

zbMATH Keywords

update operationsvines and vineyardzigzag persistence

Mathematics Subject Classification ID

Computational methods for problems pertaining to algebraic topology (55-08) Persistent homology and applications, topological data analysis (55N31)

Cites work

• Barcodes of towers and a streaming algorithm for persistent homology
• Extending persistence using Poincaré and Lefschetz duality
• Fast computation of zigzag persistence
• scientific article; zbMATH DE number 5506200 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• Revisiting graph persistence for updates and efficiency
• Semi-simplicial complexes and singular homology
• Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
• Zigzag persistence
• Zigzag Persistence via Reflections and Transpositions
• Zigzag persistent homology and real-valued functions
• Zigzag zoology: Rips zigzags for homology inference

Cited in

(2)

• A fast algorithm for computing zigzag representatives
• Pruning vineyards: updating barcodes and representative cycles by removing simplices

This page was built for publication: Computing zigzag vineyard efficiently including expansions and contractions

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