The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
Topological Persistence and Simplification
Open accessOverview
AI snapshot
Written from the paper’s full text.
TL;DR
This paper formalizes topological persistence in a filtration, using the lifetime of homology classes to distinguish features from noise, and gives algorithms to compute persistence and simplify filtrations. It demonstrates the approach on alpha-complex filtrations of molecular and surface data, including separation of a tunnel in Gramicidin A from shorter-lived cycles.
Key findings
- Persistence is defined for Betti numbers and non-bounding cycles by factoring a cycle group at one filtration stage by the boundary group at a later stage; cycles with short lifetimes are treated as topological noise, while longer-lived ones are features.
- The pairing algorithm matches positive \(k\)-simplices with negative \((k+1)\)-simplices; index-based persistence is \(j-i-1\), and the worst-case running time is \(O(m^3)\), with union-find acceleration for \(k=0\) and \(k=2\) giving amortized \(O(A^{-1}(m))\) per operation.
- On five datasets, total persistence timings ranged from 0.06 s for Gramicidin A to 19.93 s for the Buddha dataset with union-find, versus 30.52 s without it; average collision counts and list lengths were small, and conflicts were rare (basic conflicts 0–1, recursive conflicts 0–212 across datasets).
- For Gramicidin A, removing 1-cycles with persistence below 2688 isolated the molecular tunnel from other topological attributes.
Methods
- The work studies finite simplicial complexes in \(\mathbb{R}^3\), especially alpha complexes of Delaunay triangulations, ordered by an age filter induced by growing weighted balls.
- Persistence is formulated algebraically as \(H^{\ell,p}_k = Z^\ell_k / (B^{\ell+p}_k \cap Z^\ell_k)\), and an abstract pairing algorithm uses a hash table and cycle search to pair simplex births with deaths; simplification is performed by reordering simplices via migration, with conflict resolution or diminution.
- Experiments implemented the algorithms with alpha-shapes software on five datasets: three weighted molecular structures and two unweighted macroscopic surfaces; timings were collected on a 266 MHz Pentium II with 128 MB RAM under Solaris 8.
Limitations
- Stated: the detailed analysis of the 1-cycle computation is left open, and the authors ask for a different, more efficient algorithm; worst-case cubic behavior contrasts with observed near-linear timing, and conflicts, though rare, require handling.
- Stated: conflict resolution by subdivision may not correspond to the alpha-complex growth model, while conflict diminution changes when cycles affect Betti numbers.
- Evident from the text: the experimental evidence covers only five datasets and a prototype implementation; time-based persistence is not developed further, and the setting is restricted to \(\mathbb{R}^3\) complexes with \(\mathbb{Z}_2\) coefficients.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
41 Own interpretation · 29 No basis given · 10 Own result · 4 Sources not found · 4 No full text of the sources
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The primary topological feature of this data is a tunnel that runs through the molecule, as shown in Fig. 17.”
§ Discrete & Computational Geometry > Feature Detection.
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The image of the homomorphism is isomorphic to the p-persistent homology group of K ℓ , im η ℓ, p k H ℓ, p k .”
§ Discrete & Computational Geometry > Algebraic Formulation.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Then Z ℓ k ∩ B ℓ+ p-1 k = Z ℓ k ∩ B ℓ+ p k , and hence β ℓ, p k = β ℓ, p-1 k”
§ Discrete & Computational Geometry > Abstract Algorithm.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After accelerating with union-find, the slowest portion of the algorithm is adding 1-cycles.”
§ Discrete & Computational Geometry > Timings.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In other words, increasing p by one shortens the persistence of all nonbounding cycles by one.”
§ Discrete & Computational Geometry > Algebraic Formulation.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“k-Triangle Lemma.The number of k-triangles containing (ℓ, p) in the index-persistence plane is β ℓ, p k .”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“While there is considerable topological noise at p = 0, a simplification process which eliminates 1cycles of persistence less than 2688 succeeds in separating the tunnel from the remaining topological attributes detected by measuring homology.”
§ Discrete & Computational Geometry > Feature Detection.
plaindirectSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption: The Gramicidin A dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We will see in Section 3 that there exists a pairing between positive k-simplices and negative (k + 1)-simplices.”
§ Discrete & Computational Geometry > Incremental Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“If follows that β ℓ, p k = β ℓ, p-1 k -1.”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaindirectn = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Monotonicity Lemma.β ℓ, p k ≤ β ℓ , p k whenever p ≤ p and ℓ ≤ ℓ ≤ ℓ + ( pp ).”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 16
- It may state two separate claims as one. 24
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The persistence of that k-cycle is one short of the difference between indices, ji -1.”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We can write each tunnel as a sum of tunnels in a basis, and β 1 is the size of the basis.”
§ Discrete & Computational Geometry > Homology Groups.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As before, β 2 is the size of a basis of voids, which is equal to the number of voids.”
§ Discrete & Computational Geometry > Homology Groups.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All Betti numbers are non-negative so pos k ≥ neg k+1 for all ℓ.”
§ Discrete & Computational Geometry > Incremental Algorithm.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All we guarantee is that d is homologous to the sum of cycles represented by the simplices in the list, and that the list contains the youngest simplex in (d), which is σ i as above.”
§ Discrete & Computational Geometry > Data Structure.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Basic and recursive conflicts exist in practice, but are rather rare, as shown in Section 6.”
§ Discrete & Computational Geometry > Conflict Lemma. All conflicts have type (1, 2).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For each simplex σ ∈ D, there is a unique birth time α(σ ) defined such that σ ∈ K (α) iff α ≥ α(σ ).”
§ Discrete & Computational Geometry > Age Filters.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The pairs (su, suv) and (tw, stu) in Fig. 6 constitute a conflict of type (1,2) and show that conflicts do occur, although our experiments in Section 6 suggest that they are rather rare.”
§ Discrete & Computational Geometry > Conflicts.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The results suggest a possible linear dependence of the running time on the size of the data, which is substantially faster than the cubic dependence proved in Section 4.”
§ Discrete & Computational Geometry > Timings.
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Tables 3 and 4 provide evidence that this might indeed be the case.”
§ Discrete & Computational Geometry > Statistics.
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Furthermore, if σ ∈ K , then all faces of σ are simplices in K .”
§ Discrete & Computational Geometry > Figure 1 illustrates a two-dimensional example of this construction.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The incremental algorithm in Section 2 asserts that β ℓ k is the number of k-intervals that contain index ℓ on the axis.”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We do not show statistics for 0-cycles in Table 4 as every 0-cycle is represented by a list of length 2.”
§ Discrete & Computational Geometry > Statistics.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Any two simplices in K are either disjoint or they intersect in a common face, which is a simplex of smaller dimension.”
§ Discrete & Computational Geometry > Figure 1 illustrates a two-dimensional example of this construction.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As substantiated in Table 2, this improvement subsumes adding 0-and 2-cycles in the marking process, shrinking the time for these to steps to essentially nothing.”
§ Discrete & Computational Geometry > Timings.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
§ Discrete & Computational Geometry > Statistics.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The total algorithm runs in time at most O( p 2 i ), which is at most O(m 3 ).”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our motivation for formulating persistent homology in (3) was to eliminate cycles with low persistence.”
§ Discrete & Computational Geometry > Lazy Migration.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“There are 4 2 = 6 possible types of conflicts, each identified by the pair (dim σ i , dim σ h ) of the dimensions of the main participants.”
§ Discrete & Computational Geometry > Conflicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The sequence of iso-surfaces obtained by increasing α represents a growth process similar to that represented by a filtration.”
§ Discrete & Computational Geometry > Approach and Results.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As cx is not a face of abx, we have removed the conflict and preserved the Betti numbers of a refined filtration.”
§ Discrete & Computational Geometry > Conflict Resolution.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“By complementarity and duality, there are no conflicts of types (1, 3) and (2, 3).”
§ Discrete & Computational Geometry > Conflict Lemma. All conflicts have type (1, 2).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We can explain the apparently linear running time documented in Table 2 by showing that the average number of collisions and the average list length are both constant.”
§ Discrete & Computational Geometry > Statistics.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The cycle search continues until it finds a collision-free cycle homologous to d, and the Collision Lemma implies that that cycle has the correct youngest positive simplex.”
§ Discrete & Computational Geometry > Collision Lemma.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A single collision takes time at most O( p i ), and the entire search for σ i takes time at most O( p 2 i ).”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Finally, we note that Robins has independently formulated an alternate but equivalent definition of persistence [10].”
§ Discrete & Computational Geometry > Algebraic Formulation.
What the sources say
- Not matchedcites [10] 10. V. Robins. Computing topology at multiple resolutions: foundations and applications to fractals and dynamics. Ph.D. thesis, Department of Applied Mathematics, University of Colorado, June 2000.
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The ordering of the new simplices specified by subdivision in Fig. 13 might not have a corresponding set of weighted balls that would generate the filtration under the growth model.”
§ Discrete & Computational Geometry > Conflict Resolution.
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
- Rests on an assumption: In alpha complex filtrations, simplices are ordered according to a particular growth model.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Recall that the number of collisions and the length of lists is bounded from above by the persistence of cycles.”
§ Discrete & Computational Geometry > Statistics.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Specifically, simplices in a filter correspond to critical points of a density function.”
§ Discrete & Computational Geometry > Approach and Results.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Hence, i contains fewer than (k + 2) p i k-simplices, and similarly g contains fewer than (k + 2) p g < (k + 2) p i k-simplices.”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For k = 0, each set is the vertex set of a connected component.Each set has exactly one yet unpaired vertex, namely the oldest one in the component.”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As a consequence of the formulation, the lifetime of every cycle is reduced regardless of its persistence, leading to the creation of k-triangles.”
§ Discrete & Computational Geometry > Lazy Migration.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
In the paper
“The problem of topological simplification was also approached by El-Sana and Varshney [5] using alpha shape inspired ideas of geometric growth.”
§ Discrete & Computational Geometry > Approach and Results.
What the sources say
- Not checked — no full text of the sourcecites [5] 5. J. El-Sana and A. Varshney. Topology simplification for polygonal virtual environments. IEEE Trans. Visual. Comput. Graphics, 4:133-144, 1998. source
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We cannot achieve the same acceleration for 1-cycles using this method, however, as there can be multiple unpaired positive edges at any time.”
§ Discrete & Computational Geometry > Collision Lemma.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The number of collisions is at most the number of positive k-simplices strictly between σ i and σ j , which is less than p i .”
§ Discrete & Computational Geometry > Collision Lemma.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We interpret these intervals as k-intervals of a simplified version of the original filtration.”
§ Discrete & Computational Geometry > 5. Simplification
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We may resolve a conflict by subdivision.Here, we achieve the correct Betti numbers for a refined complex and its corresponding filtrations.”
§ Discrete & Computational Geometry > Conflict Resolution.
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“At the time we move it, the face is already collocated with its matching negative simplex, and the two cancel each other's contributions.”
§ Discrete & Computational Geometry > 5. Simplification
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A collision happens at T[g] only if σ g already forms a pair, which implies its k-interval [g, h) is contained inside [i, j).”
§ Discrete & Computational Geometry > Collision Lemma.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The authors state this as an assumption.
The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
“We assume general position, where at most four (three in R 2 ) Voronoi regions can have a non-empty common intersection.”
The paper relies on this without support.
Complexes embedded in three-dimensional Euclidean space have no torsion.
“There is no torsion in complexes embedded in three-dimensional Euclidean space, so the homology groups are vector spaces.”
The paper relies on this without support.
In alpha complex filtrations, simplices are ordered according to a particular growth model.
“For example, in alpha complex filtrations, simplices are ordered according to a particular growth model.”
The paper relies on this without support.
The five data sets used in the experiments are representative of their respective classes of molecular structures and macroscopic shapes.
“We have applied the software to a variety of datasets and show the results for five representative sets in this section.”
The paper relies on this without support.
The Gramicidin A dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.
“This dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In other words, the authors prove constructively that persistent homology groups of subcomplexes of S 3 , if computed over Z 2 coefficients, have a simple description in terms of a set of intervals.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Surprisingly, the authors show that these intervals allowed the correct computation of the rank of persistent homology groups.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The authors also provide an algorithm that worked only for spaces that were subcomplexes of S 3 over Z 2 coefficients.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Therefore, the P -intervals discussed here are precisely the so-called k -intervals utilized in [11] to describe persistent Z 2-homology.”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“Lemma 3.1. Let T be the set of triangles defined by P -intervals for the k-dimensional persistence module . The rank β l , p k of H l , p k is the number of triangles in T containing the point ( l , p ) .”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“This algorithm is a generalized version of the pairing algorithm shown in [11].”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“Then im η i , p k ≃ H i , p k [11], [18].”
From Computing Persistent Homology (2005) · cites this paper as [11]
In the citing paper
“As a result, persistent homology can capture topological structures continuously over a range of spatial scales.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [17]
In the citing paper
“Unlike commonly used computational homology which results in truly metric free representations, persistent homology embeds geometric information in topological invariants, e.g., Betti numbers, so that 'birth' and 'death' of isolated components, rings, and cavities can be monitored at all geometric scales by topological measurements.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [17]
In the citing paper
“Persistent homology22–25—a new branch of algebraic topology—is able to bridge geometry and topology, leading to a new efficient approach for the simplification of biological structural complexity26–31; however, it neglects critical chemical/biological information when it is directly applied to complex biomolecular structures.”
From A topology-based network tree for the prediction of protein–protein binding affinity changes following mutation (2020) · cites this paper as [23]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Discrete & Computational Geometry > Algebraic Formulation.
“The p-persistent homology groups can also be defined using injective homomorphisms between ordinary homology groups.”
§ Discrete & Computational Geometry > Algebraic Formulation.
“Note that as we increase p, negative simplices cancel positive simplices earlier in the filtration.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Discrete & Computational Geometry > Statistics.
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
§ Discrete & Computational Geometry > 7. Future Directions
“| G | 10 | 2.47 | 2.22 | 111 | 4.86 | 2.08 |”
Citations
Cites
Rayward-Smith, V. J., Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1991) · Journal of the Operational Research Society · doi:10.2307/2583667 · Cited by 16,958
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Level Set Methods: An Overview and Some Recent Results
Osher, S., & Fedkiw, R. P. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2000.6636 · Cited by 2,327
Elements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,113
ELEMENTS OF ALGEBRAIC TOPOLOGY
Kuratowski, K. (1972) · Elsevier eBooks · doi:10.1016/b978-0-08-016160-0.50028-2 · Cited by 1,290
A User's Guide to Spectral Sequences
McCleary, J. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626289 · Cited by 838
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Grossman, P. A. (1995) · doi:10.1007/978-1-349-13908-8_1 · Cited by 676
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
Topology simplification for polygonal virtual environments
El-Sana, J., & Varshney, A. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.694955 · Cited by 58
Research works printed but not linked: 2
- [8]8. J. Milnor. Morse Theory. Princeton University Press, Princeton, New Jersey, 1963.
- [11]11. J. A. Sethian. Level Set Methods. Cambridge University Press, Cambridge, 1996. Received March 19, 2001, and in revised form October 4, 2001. Online publication October 29, 2002.
Cited by
Sorted by citations
Items 401–500 of 1,811
Probabilistic convergence and stability of random mapper graphs
Brown, A., Bobrowski, O., Munch, E., & Wang, B. (2020) · Journal of Applied and Computational Topology · doi:10.1007/s41468-020-00063-x · Cited by 27
Simplification of three-dimensional density maps
Natarajan, V., & Edelsbrunner, H. (2004) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2004.32 · Cited by 29
Enhancing financial time series forecasting through topological data analysis
de Jesus, L. C., Fernández‐Navarro, F., & Carbonero-Ruz, M. (2025) · Neural Computing and Applications · doi:10.1007/s00521-024-10787-x · Cited by 28
Multiresolution Topological Simplification
Xia, K., Zhao, Z., & Wei, G. (2015) · Journal of Computational Biology · doi:10.1089/cmb.2015.0104 · Cited by 28
Tracing patterns and shapes in remittance and migration networks via persistent homology
Ignacio, P. S., & Darcy, I. K. (2019) · EPJ Data Science · doi:10.1140/epjds/s13688-018-0179-z · Cited by 28
High-Throughput Segmentation of Tiled Biological Structures using Random-Walk Distance Transforms
Baum, D., Weaver, J. C., Zlotnikov, I., et al. (2019) · Integrative and Comparative Biology · doi:10.1093/icb/icz117 · Cited by 28
Dynamic Nested Tracking Graphs
Lukasczyk, J., Garth, C., Weber, G. H., et al. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2019.2934368 · Cited by 28
Chen, C., & Freedman, D. (2008) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2008.1343 · Cited by 25
Scalar Field Analysis over Point Cloud Data
Chazal, F., Guibas, L. J., Oudot, S., & Škraba, P. (2011) · Discrete & Computational Geometry · doi:10.1007/s00454-011-9360-x · Cited by 27
Persistent Homology of Morse Decompositions in Combinatorial Dynamics
Dey, T. K., Juda, M., Kapela, T., Kubica, J., Lipiński, M., & Mrożek, M. (2019) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/18m1198946 · Cited by 28
LFM-Pro: a tool for detecting significant local structural sites in proteins
Saçan, A., Öztürk, Ö., Ferhatosmanoğlu, H., et al. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl685 · Cited by 28
Geometric Inference on Kernel Density EstimatesPreprint
Phillips, J. M., Wang, B., & Zheng, Y. L. (2013) · arXiv (Cornell University) · doi:10.4230/lipics.socg.2015.857 · Cited by 41
Atom-specific persistent homology and its application to protein flexibility analysis
Bramer, D., & Wei, G. (2020) · Computational and Mathematical Biophysics · doi:10.1515/cmb-2020-0001 · Cited by 32
Natural pseudo-distances between closed curves
Donatini, P., & Frosini, P. (2009) · Forum Mathematicum · doi:10.1515/forum.2009.049 · Cited by 27
Homological methods for extraction and analysis of linear features in multidimensional images
Mrożek, M., Żelawski, M., Gryglewski, A., et al. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.04.020 · Cited by 27
Theory of interleavings on categories with a flow
de Silva, V., Munch, E., & Stefanou, A. (2018) · Theory and applications of categories · doi:10.70930/tac/22cqkxsw · Cited by 26
Maljovec, D., Liu, S., Wang, B., Mandelli, D., Bremer, P., Pascucci, V., & Smith, C. L. (2015) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2015.07.001 · Cited by 27
Output-Sensitive Construction of Reeb Graphs
Doraiswamy, H., & Natarajan, V. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.37 · Cited by 27
Bartholdi, L., Schick, T., Smale, N., & Smale, S. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9107-3 · Cited by 26
NONLINEAR STATISTICS OF HUMAN SPEECH DATA
BROWN, K. A., & KNUDSON, K. P. (2009) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127409024086 · Cited by 26
Topological learning for brain networks
Songdechakraiwut, T., & Chung, M. K. (2023) · The Annals of Applied Statistics · doi:10.1214/22-aoas1633 · Cited by 32
Jiang, P., Chi, Y., Li, X., Meng, Z., Liu, X., Hua, X., & Xia, K. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab527 · Cited by 27
Kunii, S., Masuzawa, K., Fogiatto, A. L., et al. (2022) · Scientific Reports · doi:10.1038/s41598-022-21971-1 · Cited by 26
Intrinsic Interleaving Distance for Merge Trees
Gasparovic, E., Munch, E., Oudot, S., et al. (2024) · La Matematica · doi:10.1007/s44007-024-00143-9 · Cited by 26
Scale Space Graph Representation and Kernel Matching for Non Rigid and Textured 3D Shape Retrieval
Garro, V., & Giachetti, A. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2477823 · Cited by 23
Improved Road Network Reconstruction using Discrete Morse Theory
Dey, T. K., Wang, J., & Wang, Y. (2017) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/3139958.3140031 · Cited by 26
Uncertainty Visualization of 2D Morse Complex Ensembles Using Statistical Summary Maps
Athawale, T. M., Maljovec, D., Yan, L., Johnson, C. R., Pascucci, V., & Wang, B. (2020) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2020.3022359 · Cited by 26
The Stability of the Apparent Contour of an Orientable 2-Manifold
Edelsbrunner, H., Morozov, D., & Patel, A. (2010) · Mathematics and visualization · doi:10.1007/978-3-642-15014-2_3 · Cited by 26
Applications of Persistent Homology to Time Varying Systems
Munch, E. (2013) · DukeSpace (Duke University) · Cited by 23
Visual Analysis of Biomolecular Surfaces
Natarajan, V., Koehl, P., Wang, Y., & Hamann, B. (2007) · Mathematics and visualization · doi:10.1007/978-3-540-72630-2_14 · Cited by 24
Topological View of Flows Inside the BOLD Spontaneous Activity of the Human Brain
Don, A. P. H., Peters, J. F., Ramanna, S., & Tozzi, A. (2020) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2020.00034 · Cited by 25
Parameter investigation of topological data analysis for EEG signals
Altindış, F., Yılmaz, B., Borisenok, S., & İçöz, K. (2020) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2020.102196 · Cited by 25
Segmentation of the Cortical Plate in Fetal Brain MRI with a Topological Loss
de Dumast, P., Kebiri, H., Atat, C., Dunet, V., Koob, M., & Cuadra, M. B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87735-4_19 · Cited by 25
Visual analysis of high dimensional point clouds using topological landscapes
Oesterling, P., Heine, C., Jänicke, H., & Scheuermann, G. (2010) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2010.5429601 · Cited by 25
Online HodgeRank on Random Graphs for Crowdsourceable QoE Evaluation
Xu, Q., Xiong, J., Huang, Q., & Yao, Y. (2014) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2013.2292568 · Cited by 24
Barcodes of Towers and a Streaming Algorithm for Persistent Homology
Kerber, M., & Schreiber, H. (2018) · Discrete & Computational Geometry · doi:10.1007/s00454-018-0030-0 · Cited by 30
Computing and Visualizing Time-Varying Merge Trees for High-Dimensional Data
Oesterling, P., Heine, C., Weber, G. H., Morozov, D., & Scheuermann, G. (2017) · Mathematics and visualization · doi:10.1007/978-3-319-44684-4_5 · Cited by 26
Towards Integrative Machine Learning and Knowledge Extraction
Holzinger, A., Goebel, R. G., Palade, V., & Ferri, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69775-8_1 · Cited by 40
Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process
Hiraoka, Y., & Shirai, T. (2017) · Random Structures and Algorithms · doi:10.1002/rsa.20718 · Cited by 25
Continuation of point clouds via persistence diagrams
Gameiro, M., Hiraoka, Y., & Obayashi, I. (2015) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2015.11.011 · Cited by 25
Quadrangulating a Mesh using Laplacian Eigenvectors
Dong, S., Bremer, P., Garland, M., et al. (2005) · Cited by 25
The Persistence Space in Multidimensional Persistent Homology
Cerri, A., & Landi, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37067-0_16 · Cited by 24
Cadiou, C., Pichon, C., Codis, S., et al. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa1853 · Cited by 24
Learning persistent homology of 3D point clouds
Zhou, C., Dong, Z., & Lin, H. (2021) · Computers & Graphics · doi:10.1016/j.cag.2021.10.022 · Cited by 24
Human Gait Identification Using Persistent Homology
León, J. L., García-Reyes, E. B., & González-Dı́az, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33275-3_30 · Cited by 24
The Persistent Homology of Distance Functions under Random Projection
Sheehy, D. R. (2014) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2582112.2582126 · Cited by 25
Memory-Efficient Computation of Persistent Homology for 3D Images Using Discrete Morse Theory
Günther, D., Reininghaus, J., Hotz, I., et al. (2011) · SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI) · doi:10.1109/sibgrapi.2011.24 · Cited by 24
Visualizing Robustness of Critical Points for 2D Time‐Varying Vector Fields
Wang, B., Rosen, P., Škraba, P., Bhatia, H., & Pascucci, V. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12109 · Cited by 23
Reconstruction using witness complexes
Guibas, L. J., & Oudot, S. (2007) · Symposium on Discrete Algorithms · doi:10.5555/1283383.1283499 · Cited by 23
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
Åkerlund, O., Unger, M., & Wang, R. (2007) · doi:10.1109/pg.2007.30 · Cited by 24
Statistical topology using persistence landscapesPreprint
Bubenik, P. (2012) · arXiv (Cornell University) · Cited by 24
Mapping of unknown environments using minimal sensing from a stochastic swarm
Dirafzoon, A., Betthauser, J., Schornick, J., Benavides, D., & Lobaton, E. J. (2014) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2014.6943102 · Cited by 23
Vietoris–Rips persistent homology, injective metric spaces, and the filling radius
Lim, S., Mémoli, F., & Okutan, O. B. (2024) · Algebraic & Geometric Topology · doi:10.2140/agt.2024.24.1019 · Cited by 51
Quantitative analysis of phase transitions in two-dimensional XY models using persistent homology
Giansiracusa, J., & Biagio Lucini, A. (2022) · Cronfa (Swansea University) · Cited by 23
Aspects of topological approaches for data science
Grbić, J., Wu, J., Xia, K., & Wei, G. (2022) · Foundations of Data Science · doi:10.3934/fods.2022002 · Cited by 24
Automatic epileptic seizure detection based on persistent homology
Wang, Z., Liu, F., Shi, S., et al. (2023) · Frontiers in Physiology · doi:10.3389/fphys.2023.1227952 · Cited by 23
Notes on the Simplification of the Morse-Smale Complex
Günther, D., Reininghaus, J., Seidel, H., & Weinkauf, T. (2014) · Mathematics and visualization · doi:10.1007/978-3-319-04099-8_9 · Cited by 22
Robustness-Based Simplification of 2D Steady and Unsteady Vector Fields
Škraba, P., Wang, B., Chen, G., et al. (2015) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2440250 · Cited by 23
Topology-based catalogue exploration framework for identifying view-enhanced tower designs
Doraiswamy, H., Júnior, N. R. F., Lage, M., et al. (2015) · ACM Transactions on Graphics · doi:10.1145/2816795.2818134 · Cited by 23
Linear-size approximations to the vietoris-rips filtration
Sheehy, D. R. (2012) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2261250.2261286 · Cited by 27
Exploring persistent local homology in topological data analysis
Fasy, B. T., & Wang, B. (2016) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2016.7472915 · Cited by 21
Materials inspired by mathematics
Kotani, M., & Ikeda, S. (2016) · Science and Technology of Advanced Materials · doi:10.1080/14686996.2016.1180233 · Cited by 23
Ranking Viscous Finger Simulations to an Acquired Ground Truth with Topology-Aware Matchings
Soler, M., Petitfrère, M., Darche, G., Plainchault, M., Conche, B., & Tierny, J. (2019) · IEEE Symposium on Large Data Analysis and Visualization · doi:10.1109/ldav48142.2019.8944365 · Cited by 22
Quantitative analysis of phase transitions in two-dimensional XY models using persistent homology
Sale, N., Giansiracusa, J., & Biagio Lucini, A. (2022) · Physical review. E · doi:10.1103/physreve.105.024121 · Cited by 36
Surya, S. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.06.033 · Cited by 23
Homological spanning forest framework for 2D image analysis
Molina‐Abril, H., & Real, P. (2012) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-012-9297-7 · Cited by 23
Interface surfaces for protein-protein complexes
Ban, Y. A., Edelsbrunner, H., & Rudolph, J. (2004) · Research in Computational Molecular Biology · doi:10.1145/974614.974642 · Cited by 23
Palande, S., Jose, V., Zielinski, B. A., Anderson, J. S., Fletcher, P. T., & Wang, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67159-8_12 · Cited by 22
Persistent cohomology and circular coordinates
de Silva, V., & Vejdemo-Johansson, M. (2009) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1542362.1542406 · Cited by 22
Gromov-Hausdorff Approximation of Filament Structure Using Reeb-type Graph
Chazal, F., & Sun, J. Z. (2014) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2582112.2582129 · Cited by 20
Leveraging the mathematics of shape for solar magnetic eruption prediction
Deshmukh, V., Berger, T. E., Bradley, E., & Meiss, J. D. (2020) · Journal of Space Weather and Space Climate · doi:10.1051/swsc/2020014 · Cited by 23
Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances
Yan, L., Masood, T. B., Rasheed, F., Hotz, I., & Wang, B. (2022) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2022.3163349 · Cited by 22
Filtration Curves for Graph Representation
O’Bray, L., Rieck, B., & Borgwardt, K. (2021) · doi:10.1145/3447548.3467442 · Cited by 22
Topological inference via meshing
Hudson, B., Miller, G. L., Oudot, S., & Sheehy, D. R. (2010) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1810959.1811006 · Cited by 22
Interactive Quadrangulation with Reeb Atlases and Connectivity Textures
Tierny, J., Daniels, J., Nonato, L. G., et al. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.270 · Cited by 22
Alpha Shape Topology of the Cosmic Web
van de Weygaert, R., Platen, E., Vegter, G., et al. (2010) · International Symposium on Voronoi Diagrams in Science and Engineering · doi:10.1109/isvd.2010.24 · Cited by 22
Optimal Cycles for Persistent Homology Via Linear Programming
Escolar, E. G., & Hiraoka, Y. (2015) · Mathematics for industry · doi:10.1007/978-4-431-55420-2_5 · Cited by 22
Topological time-series analysis with delay-variant embedding
Tran, Q. H., & Hasegawa, Y. (2019) · Physical review. E · doi:10.1103/physreve.99.032209 · Cited by 22
Computing geometry-aware handle and tunnel loops in 3D models
Dey, T. K., Li, K., Sun, J. Z., et al. (2008) · ACM SIGGRAPH Conference Papers (SIGGRAPH) · doi:10.1145/1399504.1360644 · Cited by 22
Diffuse Interface Energies Capturing the Euler Number: Relaxation and Renomalization
Du, Q., Liu, C., Ryham, R., et al. (2007) · Communications in Mathematical Sciences · doi:10.4310/cms.2007.v5.n1.a10 · Cited by 22
Levenson, R. M., Singh, Y., Rieck, B., Hathaway, Q. A., Farrelly, C., Rozenblit, J., Prasanna, P., Erickson, B. J., Choudhary, A., Carlsson, G., et al. (2024) · Laboratory Investigation · doi:10.1016/j.labinv.2024.102060 · Cited by 25
On the computational complexity of Betti numbers: reductions from matrix rank
Edelsbrunner, H., & Parsa, S. (2014) · doi:10.5555/2634074.2634085 · Cited by 23
Through synapses to spatial memory maps via a topological model
Dabaghian, Y. A. (2019) · Scientific Reports · doi:10.1038/s41598-018-36807-0 · Cited by 19
Liang, D., Xia, S., Zhang, X., & Zhang, W. (2021) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2021.745671 · Cited by 21
Reducing complexes in multidimensional persistent homology theory
Állili, M., Kaczyński, T., & Landi, C. (2016) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2015.11.020 · Cited by 21
Efficient construction of the Čech complex
Dantchev, S. S., & Ivrissimtzis, I. P. (2012) · Computers & Graphics · doi:10.1016/j.cag.2012.02.016 · Cited by 21
Automatic Procedures to Create CAD Models from Measured Data
Várady, T. (2008) · Computer-Aided Design and Applications · doi:10.3722/cadaps.2008.577-588 · Cited by 21
Biobotic insect swarm based sensor networks for search and rescue
Bozkurt, A. Y., Lobaton, E. J., Sichitiu, M. L., et al. (2014) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2053906 · Cited by 21
Flow-complex-based shape reconstruction from 3D curves
Sadri, B., & Singh, K. S. (2014) · ACM Transactions on Graphics · doi:10.1145/2560328 · Cited by 21
Exploring and Comparing Clusterings of Multivariate Data Sets Using Persistent Homology
Rieck, B., & Leitte, H. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12884 · Cited by 23
Limit theorems for Betti numbers of extreme sample clouds with application to persistence barcodes
Owada, T. (2018) · The Annals of Applied Probability · doi:10.1214/17-aap1375 · Cited by 18
Persistence Bag-of-Words for Topological Data Analysis
Zieliński, B., Lipiński, M., Juda, M., et al. (2019) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/624 · Cited by 21
Dubuc, B., Ebrahimkhanlou, A., & Salamone, S. (2019) · Smart Materials and Structures · doi:10.1088/1361-665x/ab0e96 · Cited by 21
EXPLORING PROTEIN FOLDING TRAJECTORIES USING GEOMETRIC SPANNERS
Russel, D., & Guibas, L. (2004) · Pacific Symposium on Biocomputing (PSB) · doi:10.1142/9789812702456_0005 · Cited by 21
Maximizing adaptivity in hierarchical topological models
Bremer, P., Pascucci, V., & Hamann, B. (2006) · doi:10.1109/smi.2005.28 · Cited by 21
Gromov–Hausdorff Approximation of Filamentary Structures Using Reeb-Type Graphs
Chazal, F., Huang, R., & Sun, J. Z. (2015) · Discrete & Computational Geometry · doi:10.1007/s00454-015-9674-1 · Cited by 20
The Persistent Homology of Dual Digital Image Constructions
Bleile, B., Garin, A., Heiss, T., et al. (2022) · Association for Women in Mathematics series · doi:10.1007/978-3-030-95519-9_1 · Cited by 20
Topology-controllable Implicit Surface Reconstruction Based on Persistent Homology
Dong, Z., Chen, J., & Lin, H. (2022) · Computer-Aided Design · doi:10.1016/j.cad.2022.103308 · Cited by 19
Swarm-intelligence-based extraction and manifold crawling along the Large-Scale Structure
Awad, P., Peletier, R. F., Canducci, M., et al. (2023) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stad428 · Cited by 20
Nudged elastic band in topological data analysis
Atanasov, A., Carlsson, G., & Adams, H. (2015) · Topological Methods in Nonlinear Analysis · doi:10.12775/tmna.2015.013 · Cited by 20
Metadata
- Authors
- Edelsbrunner, Letscher, & Zomorodian
- Affiliations
- Duke University (US)
- Oklahoma State University (US)
- University of Illinois Urbana-Champaign (US)
- Venue
- Discrete & Computational Geometry
- Published
- 2002-11
- Volume
- 28
- Issue
- 4
- Pages
- 511-533
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W3013843370
- Cited by
- 1,779
- References
- 12
- Citations by year
- 2026: 130 · 2025: 152 · 2024: 125 · 2023: 94 · 2022: 91 · 2021: 139 · 2020: 106 · 2019: 131 · 2018: 101 · 2017: 72 · 2016: 89 · 2015: 70 · 2014: 74 · 2013: 47 · 2012: 63
- FWCI
- 13.65
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Discrete & Computational Geometry (publishedVersion)
- Funders
- National Science Foundation (9712088)
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Image Processing Techniques
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Keywords
- topological persistence, topological simplification, simplicial complexes, filtration, computational topology
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
