Fast construction of the Vietoris-Rips complex

@article{Zomorodian2010FastCO,
title={Fast construction of the Vietoris-Rips complex},
author={Afra Zomorodian},
journal={Comput. Graph.},
year={2010},
volume={34},
pages={263-271}
}
• A. Zomorodian
• Published 1 June 2010
• Computer Science, Mathematics
• Comput. Graph.
173 Citations

Figures and Tables from this paper

. We present a new, inductive construction of the Vietoris-Rips complex, in which we take advantage of a small amount of unexploited combinatorial structure in the k -skeleton of the complex in order
While the Vietoris-Rips complex is now widely used in both topological data analysis and the theory of hyperbolic groups, many of the fundamental properties of its homology have remained elusive. In
• Mathematics
2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
• 2019
A new way of constructing sparse roadmaps using point clouds that approximates and measures the underlying topology of the Cfree space and performs a series of topological collapses to remove vertices from the graph while still preserving its topological properties.
• Computer Science
ArXiv
• 2019
It is proved that -net, as a choice of landmarks, is an -approximate representation of the point cloud and the induced lazy witness complex is a 3-approximation of the induced Vietoris-Rips complex and three algorithms to construct -net landmarks are proposed.
The tidy set is introduced, a minimal simplicial set that captures the topology of a simplicial complex that is particularly effective for computing the homology of clique complexes.
• Computer Science
ArXiv
• 2022
An algorithm that computes the generalized ˇCech complex for a set of disks where each may have a diﬀerent radius in 2D space is presented and an eﬃcient veriﬁcation method is proposed to see if a k -simplex can be constructed on the basis of the ( k − 1)-simplices.
• Mathematics, Computer Science
IEICE Trans. Inf. Syst.
• 2015
A faster algorithm is proposed based on two well-known algorithms called Bron-Kerbosch and Tomita-Tanaka- Takahashi for enumerating all max- imal cliques in unit disk graphs, which is a plausible setting for applications of similar data groups.
The utility of the oracle-based framework for constructing simplicial complexes over arbitrary topological spaces is demonstrated by presenting three applications: to multiword search in Google, to the computational analysis of a language and to the study of protein structure.
• Mathematics
SoCG '11
• 2011
This work shows that Rips complexes can also be used to provide topologically correct reconstruction of shapes and compares well with previous approaches when X is a smooth set and surprisingly enough, even improves constants when X has a positive μ-reach.
• Mathematics
• 2018
In a known papers, A. Ivashchenko shows the family of contractible graphs, constructed from $K(1)$ by contractible transformations, and he proves that such transformations do not change the homology

References

SHOWING 1-10 OF 49 REFERENCES

The tidy set is introduced, a minimal simplicial set that captures the topology of a simplicial complex that is particularly effective for computing the homology of clique complexes.
• Mathematics
PBG
• 2004
This paper tackles the problem of computing topological invariants of geometric objects in a robust manner, using only point cloud data sampled from the object, and produces a nested family of simplicial complexes, which represent the data at different feature scales, suitable for calculating persistent homology.
• Computer Science
SCG '09
• 2009
A new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension is described and a modification of the algorithm that uses and stores only theDelaunay graph (the edges of the full triangulation) is proposed.
• Economics
Proceedings 41st Annual Symposium on Foundations of Computer Science
• 2000
Fast algorithms for computing persistence and experimental evidence for their speed and utility are given for topological simplification within the framework of a filtration, which is the history of a growing complex.
• Mathematics, Computer Science
SIAM J. Comput.
• 1977
This paper presents a new efficient algorithm for generating all the maximal independent sets, for which processing time and memory space are bounded by $O(nm\mu)$ and $O (n+m)$, respectively, where n, m, and $\mu$ are the numbers of vertices, edges, and maximalIndependent sets of a graph.
• D. Kozlov
• Mathematics
Algorithms and computation in mathematics
• 2008
Concepts of Algebraic Topology, Applications of Spectral Sequences to Hom Complexes, and Structural Theory of Morphism Complexes are presented.
• Mathematics
SCG '04
• 2004
The analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields and derives an algorithm for computing individual persistent homological groups over an arbitrary principal ideal domain in any dimension.
• Computer Science
• 2005
The bottom-line of this study is the investigation of the trade-off between output sensitivity and the overhead associated to the identification of dominated nodes.