A Vietoris--Rips complex is a way to thicken a (possibly discrete) metric space into a larger space containing more topological information. We prove that if C is a convex closed differentiable curve in the plane such that the convex hull of C contains the evolute of C, then the homotopy type of a Vietoris--Rips complex of a subset of n points from C can be computed in time O(n  \log n) . Furthermore, we show how to compute the k-dimensional persistent homology of these n points in running time O(n^2(k+\log n)), which is nearly quadratic in the number of vertices n . This improves upon the traditional persistent homology algorithm, which is cubic in the number of simplices of dimension at most k+1, and hence of running time O(n^{3(k+2)}) in the number of vertices n  . We ask if there are other geometric settings in which computing persistent homology is (say) quadratic or cubic in the number of vertices, instead of in the number of simplices.
We give an O(n ^2(k+ \log n) ) algorithm for computing the k-dimensional persistent homology of a filtration of clique complexes of cyclic graphs on n vertices. This is nearly quadratic in the number of vertices n , and therefore a large improvement upon the traditional persistent homology algorithm, which is cubic in the number of simplices of dimension at most k+1, and hence of running time O(n^{3(k+2)}) in the number of vertices n . Our algorithm applies, for example, to Vietoris--Rips complexes of points sampled from a curve in \mathbb{R . We ask if there are other geometric settings in which computing persistent homology is (say) quadratic or cubic in the number of vertices, instead of in the number of simplices.
R
A Vietoris--Rips complex is a way to thicken a (possibly discrete) metric space into a larger space containing more topological information. We prove that if C is a convex closed differentiable curve in the plane such that the convex hull of C contains the evolute of C, then the homotopy type of a Vietoris--Rips complex of a subset of n points from C can be computed in time
We give an
A
^2(k+
R
. Furthermore, we show how to compute
) algorithm for computing
R
these n points in running time O(n^2(k+\log n)), which
a filtration of clique complexes of cyclic graphs on n vertices. This
R
. This improves
, and therefore a large improvement
A
. Our algorithm applies, for example, to Vietoris--Rips complexes of points sampled from a curve in \mathbb{R