Topological Inference via Meshing

Abstract : We apply ideas from mesh generation to improve the time and space complexities of computing the full persistent homological information associated with a point cloud $P$ in Euclidean space $\R^d$. Classical approaches rely on the \v Cech, Rips, $\alpha$-complex, or witness complex filtrations of $P$, whose complexities scale up very badly with $d$. For instance, the $\alpha$-complex filtration incurs the $n^{\Omega(d)}$ size of the Delaunay triangulation, where $n$ is the size of $P$. The common alternative is to truncate the filtrations when the sizes of the complexes become prohibitive, possibly before discovering the most relevant topological features. In this paper we propose a new collection of filtrations, based on the Delaunay triangulation of a carefully-chosen superset of $P$, whose sizes are reduced to $2^{O(d^2)}n$. A nice property of these filtrations is to be interleaved multiplicatively with the family of offsets of $P$, so that the persistence diagram of $P$ can be approximated in $2^{O(d^2)}n^3$ time in theory, with a near-linear observed running time in practice (ignoring the constant factors depending exponentially on $d$). Thus, our approach remains tractable in medium dimensions, say 4 to 10.
Document type :
[Research Report] RR-7125, INRIA. 2009
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download
Contributor : Steve Oudot <>
Submitted on : Thursday, December 3, 2009 - 9:31:21 AM
Last modification on : Saturday, January 27, 2018 - 1:30:56 AM
Document(s) archivé(s) le : Saturday, November 26, 2016 - 3:30:13 PM


Files produced by the author(s)


  • HAL Id : inria-00436891, version 3



Benoît Hudson, Gary Miller, Steve Oudot, Donald Sheehy. Topological Inference via Meshing. [Research Report] RR-7125, INRIA. 2009. 〈inria-00436891v3〉



Record views


Files downloads