Polynomial-Sized Topological Approximations Using The Permutahedron
From MaRDI portal
Publication:3132865
DOI10.4230/LIPIcs.SoCG.2016.31zbMath1387.68251arXiv1601.02732OpenAlexW2962690439MaRDI QIDQ3132865
Aruni Choudhary, Sharath Raghvendra, Michael Kerber
Publication date: 30 January 2018
Full work available at URL: https://arxiv.org/abs/1601.02732
approximation algorithmstopological data analysispersistent homologypermutahedronsimplicial approximation
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Simplicial sets and complexes in algebraic topology (55U10)
Related Items (6)
Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations ⋮ Barcodes of towers and a streaming algorithm for persistent homology ⋮ Polynomial-sized topological approximations using the permutahedron ⋮ Strong Collapse for Persistence ⋮ Improved Approximate Rips Filtrations with Shifted Integer Lattices ⋮ Computing Persistent Homology of Flag Complexes via Strong Collapses
This page was built for publication: Polynomial-Sized Topological Approximations Using The Permutahedron
