Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.23
URN: urn:nbn:de:0030-drops-50893
URL: https://drops.dagstuhl.de/opus/volltexte/2015/5089/
Cavanna, Nicholas J. ; Jahanseir, Mahmoodreza ; Sheehy, Donald R.
Visualizing Sparse Filtrations
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{cavanna_et_al:LIPIcs:2015:5089,
author = {Nicholas J. Cavanna and Mahmoodreza Jahanseir and Donald R. Sheehy},
title = {{Visualizing Sparse Filtrations}},
booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)},
pages = {23--25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-83-5},
ISSN = {1868-8969},
year = {2015},
volume = {34},
editor = {Lars Arge and J{\'a}nos Pach},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5089},
URN = {urn:nbn:de:0030-drops-50893},
doi = {10.4230/LIPIcs.SOCG.2015.23},
annote = {Keywords: Topological Data Analysis, Simplicial Complexes, Persistent Homology}
}
| Keywords: | Topological Data Analysis, Simplicial Complexes, Persistent Homology | |
| Seminar: | 31st International Symposium on Computational Geometry (SoCG 2015) | |
| Issue date: | 2015 | |
| Date of publication: | 12.06.2015 |
