Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry 2013
DOI: 10.1145/2462356.2462387
|View full text |Cite
|
Sign up to set email alerts
|

Graph induced complex on point data

Abstract: The efficiency of extracting topological information from point data depends largely on the complex that is built on top of the data points. From a computational viewpoint, the most favored complexes for this purpose have so far been Vietoris-Rips and witness complexes. While the Vietoris-Rips complex is simple to compute and is a good vehicle for extracting topology of sampled spaces, its size is hugeparticularly in high dimensions. The witness complex on the other hand enjoys a smaller size because of a subs… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
38
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 33 publications
(39 citation statements)
references
References 24 publications
1
38
0
Order By: Relevance
“…The task for extracting the topological signatures from the vertices set, i.e., the data point cloud. There are different ways to build the complex to approximate the topological space, such as Vietoris-Rips complex [32,33], Graph-induced complex [34], and Sparsified Cěch complex [35]. In this work we adopt the Vietoris-Rips complex, which sometimes was called Rips complex for simplicity.…”
Section: The Rips Complex and Graph Filtrationmentioning
confidence: 99%
“…The task for extracting the topological signatures from the vertices set, i.e., the data point cloud. There are different ways to build the complex to approximate the topological space, such as Vietoris-Rips complex [32,33], Graph-induced complex [34], and Sparsified Cěch complex [35]. In this work we adopt the Vietoris-Rips complex, which sometimes was called Rips complex for simplicity.…”
Section: The Rips Complex and Graph Filtrationmentioning
confidence: 99%
“…However, the Cěch complex needs intensive computation. Several reduction complexes had been proposed, such as Vietoris − Rips complex [60,61], Graph − induced complex [62], and Sparsi f ied Cěch complex [63]. The Vietoris − Rips complex had already proved to be computational efficiently and used in data analysis; therefore we use the Vietoris − Rips complex to approximate the data point cloud topological space, and later for topological analysis.…”
Section: Topological Data Analysismentioning
confidence: 99%
“…Graph Induced Complex GIC. T. Dey et al [DFW13] built GIC depending on a scale α and a user‐defined graph that spans a cloud C . If C is an ε‐sample of a good manifold, then GIC has the same homology H 1 as the Vietoris‐Rips complex on C at scales α ≥ 4ε.…”
Section: Comparison With Related Past Skeletonization Workmentioning
confidence: 99%
“…Graph Induced Complex GIC. T. Dey et al [DFW13] built GIC depending on a scale α and a user-defined graph that spans a cloud C. If C is an ε-sample of a good manifold, then GIC has the same homology H 1 as the Vietoris-Rips complex on C at scales α ≥ 4ε. Theorem 15 describes graphs G that can be geometrically and topologically approximated from any ε-sample C without extra input parameters.…”
Section: Comparison With Related Past Skeletonization Workmentioning
confidence: 99%