Visualizing Sparse Filtrations

Authors Nicholas J. Cavanna, Mahmoodreza Jahanseir, Donald R. Sheehy

Thumbnail PDF


  • Filesize: 0.84 MB
  • 3 pages

Document Identifiers

Author Details

Nicholas J. Cavanna
Mahmoodreza Jahanseir
Donald R. Sheehy

Cite AsGet BibTex

Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy. Visualizing Sparse Filtrations. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 23-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


Over the last few years, there have been several approaches to building sparser complexes that still give good approximations to the persistent homology. In this video, we have illustrated a geometric perspective on sparse filtrations that leads to simpler proofs, more general theorems, and a more visual explanation. We hope that as these techniques become easier to understand, they will also become easier to use.
  • Topological Data Analysis
  • Simplicial Complexes
  • Persistent Homology


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads