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 501–600 of 1,811
An iterative algorithm for homology computation on simplicial shapes
Boltcheva, D., Canino, D., Merino-Aceituno, S., Léon, J.-C., Floriani, L. D., & Hétroy, F. (2011) · Computer-Aided Design · doi:10.1016/j.cad.2011.08.015 · Cited by 20
Relation-Aware Isosurface Extraction in Multifield Data
Nagaraj, S., & Natarajan, V. (2010) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2010.64 · Cited by 20
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
Boissonnat, J., Dey, T. K., & Maria, C. (2015) · Algorithmica · doi:10.1007/s00453-015-9999-4 · Cited by 20
Using Contour Trees in the Analysis and Visualization of Radio Astronomy Data Cubes
Rosen, P., Seth, A. C., Mills, E. A. C., et al. (2021) · Mathematics and visualization · doi:10.1007/978-3-030-83500-2_6 · Cited by 20
Perturbation Robust Representations of Topological Persistence Diagrams
Som, A., Thopalli, K., Ramamurthy, K. N., Venkataraman, V., Shukla, A., & Turaga, P. K. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01234-2_38 · Cited by 19
Unsupervised space–time clustering using persistent homology
Islambekov, U., & Gel, Y. R. (2018) · Environmetrics · doi:10.1002/env.2539 · Cited by 19
On interval decomposability of 2D persistence modules
Asashiba, H., Buchet, M., Escolar, E. G., Nakashima, K., & Yoshiwaki, M. (2022) · Computational Geometry · doi:10.1016/j.comgeo.2022.101879 · Cited by 33
Robust spatial memory maps encoded by networks with transient connections
Babichev, A., Morozov, D., & Dabaghian, Y. A. (2018) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1006433 · Cited by 16
Persistent homology analysis of brain transcriptome data in autism
Shnier, D., Voineagu, M., & Voineagu, I. (2019) · Journal of The Royal Society Interface · doi:10.1098/rsif.2019.0531 · Cited by 17
A higher-dimensional homologically persistent skeleton
Kališnik, S., Kurlin, V. A., & Lešnik, D. (2018) · Advances in Applied Mathematics · doi:10.1016/j.aam.2018.07.004 · Cited by 18
Persistent Homology in Data Science
Huber, S. (2021) · Springer eBooks · doi:10.1007/978-3-658-32182-6_13 · Cited by 24
Arousal increases the representational capacity of cortical tissue
Fekete, T., Pitowsky, I., Grinvald, A., & Omer, D. B. (2009) · Journal of Computational Neuroscience · doi:10.1007/s10827-009-0138-6 · Cited by 20
3D Shape Description and Matching Based on Properties of Real Functions
Biasotti, S., Falcidieno, B., Frosini, P., Giorgi, D., Landi, C., Marini, S., Patanè, G., & Spagnuolo, M. (2007) · CINECA IRIS Institutial research information system (University of Pisa) · doi:10.2312/egt.20071071 · Cited by 20
Persistent Homology and the Upper Box Dimension
Schweinhart, B. (2019) · Discrete & Computational Geometry · doi:10.1007/s00454-019-00145-3 · Cited by 19
Persistent homology analysis of osmolyte molecular aggregation and their hydrogen-bonding networks
Xia, K., Anand, D. V., Saxena, S., & Mu, Y. (2019) · Physical Chemistry Chemical Physics · doi:10.1039/c9cp03009c · Cited by 17
Topology Based Selection and Curation of Level Sets
Bajaj, C., Gillette, A., & Goswami, S. (2009) · Mathematics and visualization · doi:10.1007/978-3-540-88606-8_4 · Cited by 20
Cut locus and topology from surface point data
Dey, T. K., & Li, K. (2009) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1542362.1542390 · Cited by 19
A spectral sequence for parallelized persistence
Lipsky, D., Skraba, P., & Vejdemo-Johansson, M. (2011) · arXiv · doi:10.48550/arxiv.1112.1245 · Cited by 22
A Brief History of PersistencePreprint
Perea, J. A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.03624 · Cited by 31
Wasserstein Stability for Persistence DiagramsPreprint
Škraba, P., & Turner, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.16824 · Cited by 135
A study on validating non-linear dimensionality reduction using persistent homology
Paul, R., & Chalup, S. K. (2017) · Pattern Recognition Letters · doi:10.1016/j.patrec.2017.09.032 · Cited by 19
Liu, X., Feng, H., Wu, J., & Xia, K. (2022) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.2c00580 · Cited by 19
la Peña, N. D., & Granados, O. M. (2023) · Information Processing in Agriculture · doi:10.1016/j.inpa.2023.03.001 · Cited by 20
Huckemann, S., Kim, K., Munk, A., et al. (2016) · MPG.PuRe (Max Planck Society) · Cited by 19
Cycle Registration in Persistent Homology With Applications in Topological Bootstrap
Reani, Y., & Bobrowski, O. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3217443 · Cited by 25
Finding self-similar behavior in quantum many-body dynamics via persistent homology
Spitz, D., Berges, J., Oberthaler, M. K., & Wienhard, A. (2021) · SciPost Physics · doi:10.21468/scipostphys.11.3.060 · Cited by 19
Visualizing nD Point Clouds as Topological Landscape Profiles to Guide Local Data Analysis
Oesterling, P., Heine, C., Weber, G. H., & Scheuermann, G. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.120 · Cited by 19
Huckemann, S., Kim, K.-R., Munk, A., et al. (2016) · Bernoulli · doi:10.3150/15-bej722 · Cited by 19
Algebraic topology for computer vision
Freedman, D. Z., Chen, C., & Freedman, D. Z. (2009) · Cited by 19
A refinement of multi-dimensional persistence
KNUDSON, K. P. (2008) · Homology Homotopy and Applications · doi:10.4310/hha.2008.v10.n1.a11 · Cited by 23
Persistence-sensitive simplification of functions on 2-manlfolds
Edelsbrunner, H., Morozov, D., & Pascucci, V. (2006) · Cited by 18
Optimal rates of convergence for persistence diagrams in Topological Data AnalysisPreprint
Chazal, F., Glisse, M., Labruère, C., & Michel, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.6239 · Cited by 19
Kurkin, S., Pisarchik, A. N., Mayorova, L. A., & Hramov, A. E. (2026) · Physics Reports · doi:10.1016/j.physrep.2026.02.004 · Cited by 25
Mapping firms’ locations in technological space: A topological analysis of patent statistics
Escolar, E. G., Hiraoka, Y., Igami, M., & Ozcan, Y. (2023) · Research Policy · doi:10.1016/j.respol.2023.104821 · Cited by 18
Harnessing the power of topological data analysis to detect change points
Islambekov, U., Yuvaraj, M., & Gel, Y. R. (2019) · Environmetrics · doi:10.1002/env.2612 · Cited by 17
Evolutionary homology on coupled dynamical systems with applications to protein flexibility analysis
Cang, Z., Munch, E., & Wei, G. (2020) · Journal of Applied and Computational Topology · doi:10.1007/s41468-020-00057-9 · Cited by 19
From a Non-Local Ambrosio-Tortorelli Phase Field to a Randomized Part Hierarchy Tree
Tari, S. Z., & Genctav, M. (2013) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-013-0441-8 · Cited by 18
Stable Morse Decompositions for Piecewise Constant Vector Fields on Surfaces
Szymczak, A. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01934.x · Cited by 18
Zigzag Zoology: Rips Zigzags for Homology Inference
Oudot, S., & Sheehy, D. R. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9219-7 · Cited by 21
Simplicial Homology of Random Configurations
Decreusefond, L., Ferraz, E., Randriambololona, H., et al. (2014) · Advances in Applied Probability · doi:10.1017/s0001867800007114 · Cited by 18
On persistent homotopy, knotted complexes and the Alexander module
Letscher, D. (2012) · doi:10.1145/2090236.2090270 · Cited by 18
A new topological descriptor for water network structure
Steinberg, L., Russo, J., & Frey, J. G. (2019) · Journal of Cheminformatics · doi:10.1186/s13321-019-0369-0 · Cited by 17
Computing Minimal Persistent Cycles: Polynomial and Hard Cases
Dey, T. K., Hou, T., & Mandal, S. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975994.158 · Cited by 18
The better turbulence index? Forecasting adverse financial markets regimes with persistent homology
Baitinger, E., & Flegel, S. (2021) · Financial markets and portfolio management · doi:10.1007/s11408-020-00377-x · Cited by 18
Servis, M. J., Sadhu, B., Soderholm, L., et al. (2021) · Journal of Molecular Liquids · doi:10.1016/j.molliq.2021.117743 · Cited by 18
Multivariate topology simplification
Chattopadhyay, A., Carr, H. A., Duke, D. J., Geng, Z., & Saeki, O. (2016) · Computational Geometry · doi:10.1016/j.comgeo.2016.05.006 · Cited by 19
Parallel Computation of Persistent Homology using the Blowup Complex
Lewis, R. H., & Morozov, D. (2015) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/2755573.2755587 · Cited by 18
Optimal homologous cycles, total unimodularity, and linear programming
Dey, T. K., Hirani, A. N., & Krishnamoorthy, B. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806721 · Cited by 18
From numerics to combinatorics: a survey of topological methods for vector field visualization
Wang, W., Wang, W., & Li, S. (2016) · Journal of Visualization · doi:10.1007/s12650-016-0348-8 · Cited by 18
Reconstructing embedded graphs from persistence diagrams
Belton, R., Fasy, B. T., Mertz, R., et al. (2020) · Computational Geometry · doi:10.1016/j.comgeo.2020.101658 · Cited by 18
Alpha-shapes and flow shapes are homotopy equivalent
Dey, T. K., Giesen, J., & John, M. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780614 · Cited by 18
Topological data analysis and topological deep learning beyond persistent homology: a review
Su, Z., Liu, X., Hamdan, L. B., Maroulas, V., Wu, J., Carlsson, G., & Wei, G.-W. (2025) · Artificial Intelligence Review · doi:10.1007/s10462-025-11462-w · Cited by 38
Topological Simplifications of Hypergraphs
Zhou, Y., Rathore, A., Purvine, E., & Wang, B. (2022) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2022.3153895 · Cited by 21
Stable volumes for persistent homology
Obayashi, I. (2023) · Journal of Applied and Computational Topology · doi:10.1007/s41468-023-00119-8 · Cited by 20
Topological and geometric analysis of cell states in single-cell transcriptomic data
Huynh, T., & Cang, Z. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae176 · Cited by 19
Morphologies of self-organizing swarms in 3D swarm chemistry
Sayama, H. (2012) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2330163.2330245 · Cited by 17
3D Artifacts Similarity Based on the Concurrent Evaluation of Heterogeneous Properties
Biasotti, S., Cerri, A., Falcidieno, B., et al. (2015) · Journal on Computing and Cultural Heritage · doi:10.1145/2747882 · Cited by 17
Topological Fidelity and Image Thresholding: A Persistent Homology Approach
Chung, Y.-M., & Day, S. (2018) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-018-0802-4 · Cited by 17
A topology-based descriptor for 3D point cloud modeling: Theory and experiments
Beksi, W. J., & Papanikolopoulos, N. P. (2019) · Image and Vision Computing · doi:10.1016/j.imavis.2019.05.004 · Cited by 16
Persistent Cohomology for Data With Multicomponent Heterogeneous Information
Cang, Z., & Wei, G. (2020) · SIAM Journal on Mathematics of Data Science · doi:10.1137/19m1272226 · Cited by 27
Thermochemical CO 2 splitting performance of perovskite coated porous ceramics
Parvanian, A. M., Salimijazi, H., Shabaninejad, M., et al. (2020) · RSC Advances · doi:10.1039/d0ra02353a · Cited by 17
Tropical Sufficient Statistics for Persistent Homology
Monod, A., Kališnik, S., Patiño-Galindo, J. Á., & Crawford, L. A. (2019) · SIAM Journal on Applied Algebra and Geometry · doi:10.1137/17m1148037 · Cited by 18
Fractal dimension and the persistent homology of random geometric complexes
Schweinhart, B. (2020) · Advances in Mathematics · doi:10.1016/j.aim.2020.107291 · Cited by 20
Analyzing stratified spaces using persistent versions of intersection and local homology
Harer, J., & Bendich, P. L. (2008) · DukeSpace (Duke University) · Cited by 15
Predicting the generalization gap in neural networks using topological data analysis
Ballester, R., Clemente, X. A., Casacuberta, C., Madadi, M., Corneanu, C. A., & Escalera, S. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.127787 · Cited by 27
Time Series Embedding Methods for Classification Tasks: A Review
Irani, H., Ghahremani, Y., Kermani, A., & Metsis, V. (2025) · Expert Systems · doi:10.1111/exsy.70148 · Cited by 26
Learning Topology: Bridging Computational Topology and Machine Learning
Moroni, D., & Pascali, M. A. (2021) · Pattern Recognition and Image Analysis · doi:10.1134/s1054661821030184 · Cited by 16
Duan, S., Wu, X., Zou, Y., et al. (2022) · Structural Health Monitoring · doi:10.1177/14759217221119790 · Cited by 16
Probing center vortices and deconfinement in SU(2) lattice gauge theory with persistent homology
Sale, N., Biagio Lucini, A., & Giansiracusa, J. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.034501 · Cited by 16
Stable volumetric features in deformable shapes
Litman, R., Bronstein, A. M., & Bronstein, M. M. (2012) · Computers & Graphics · doi:10.1016/j.cag.2012.03.034 · Cited by 16
An output-sensitive algorithm for persistent homology
Chen, C., & Kerber, M. (2011) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1998196.1998228 · Cited by 15
Chung, M. K. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316882610 · Cited by 18
Homological approximations in persistence theory
Blanchette, B., Brüstle, T., & Hanson, E. J. (2022) · Canadian Journal of Mathematics · doi:10.4153/s0008414x22000657 · Cited by 16
Guillou, P., Vidal, J., & Tierny, J. (2023) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2023.3238008 · Cited by 16
Hierarchy of Stable Morse Decompositions
Szymczak, A. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.147 · Cited by 16
Action classification from motion capture data using topological data analysis
Dirafzoon, A., Lokare, N., & Lobaton, E. J. (2016) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2016.7906043 · Cited by 16
Parametrized homology via zigzag persistence
Carlsson, G., de Silva, V., Kališnik, S., & Morozov, D. (2019) · eScholarship (California Digital Library) · Cited by 16
Exact Topology of the Dynamic Probability Surface of an Activated Process by Persistent Homology
Manuchehrfar, F., Li, H., Tian, W., Ma, A., & Liang, J. (2021) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.1c00904 · Cited by 16
Local, smooth, and consistent Jacobi set simplification
Bhatia, H., Wang, B., Norgard, G. J., et al. (2014) · Computational Geometry · doi:10.1016/j.comgeo.2014.10.009 · Cited by 16
Persistence for Circle Valued MapsPreprint
Burghelea, D., & Dey, T. K. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1104.5646 · Cited by 13
Topological Data Analysis of Financial Time Series: Landscapes of CrashesPreprint
Gidea, M., & Katz, Y. A. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.2931836 · Cited by 17
On approximation of 2D persistence modules by interval-decomposables
Asashiba, H., Escolar, E. G., Nakashima, K., & Yoshiwaki, M. (2023) · Journal of Computational Algebra · doi:10.1016/j.jaca.2023.100007 · Cited by 22
Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions
Botnan, M. B., Oppermann, S., & Oudot, S. (2024) · Foundations of Computational Mathematics · doi:10.1007/s10208-024-09672-9 · Cited by 15
Cosmological Probes of Structure Growth and Tests of Gravity
Hou, J., Bautista, J., Berti, M., Cuesta-Lazaro, C., Hernández‐Aguayo, C., Tröster, T., & Zheng, J. (2023) · Universe · doi:10.3390/universe9070302 · Cited by 15
Hybrid Topological Data Analysis and Deep Learning for Basal Cell Carcinoma Diagnosis
Maurya, A., Stanley, R. J., Lama, N., Nambisan, A. K., Patel, G., Saeed, D., Swinfard, S., Smith, C. I., Jagannathan, S., Hagerty, J. R., et al. (2024) · Journal of Imaging Informatics in Medicine · doi:10.1007/s10278-023-00924-8 · Cited by 19
Doraiswamy, H., Shivashankar, N., Natarajan, V., & Wang, Y. (2013) · Computers & Graphics · doi:10.1016/j.cag.2013.04.009 · Cited by 15
Reconstructing 3D compact sets
Cazals, F., & Cohen‐Steiner, D. (2011) · Computational Geometry · doi:10.1016/j.comgeo.2011.07.005 · Cited by 16
High-quality vertex clustering for surface mesh segmentation using Student- mixture model
Tsuchie, S., Hosino, T., & Higashi, M. (2013) · Computer-Aided Design · doi:10.1016/j.cad.2013.08.019 · Cited by 15
Mathematical Tools for Shape Analysis and Description
Biasotti, S., Falcidieno, B., Giorgi, D., & Spagnuolo, M. (2014) · Synthesis lectures on computer graphics and animation · doi:10.1007/978-3-031-79558-9 · Cited by 17
Topological analysis and visualization of cyclical behavior in memory reference traces
Choudhury, A. N. M. I., Wang, B., Rosen, P., et al. (2012) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2012.6183557 · Cited by 15
Persistent homology and string vacua
Cirafici, M. (2016) · Journal of High Energy Physics · doi:10.1007/jhep03(2016)045 · Cited by 20
Shape Terra: mechanical feature recognition based on a persistent heat signature
Harik, R., Shi, Y., & Baek, S. (2016) · Computer-Aided Design and Applications · doi:10.1080/16864360.2016.1223433 · Cited by 14
Schupbach, J., Fasy, B. T., Sheppard, J. W., & Lawson, P. J. (2019) · SPIE Medical Imaging: Digital and Computational Pathology · doi:10.1117/12.2513137 · Cited by 14
Critical Point Cancellation in 3D Vector Fields: Robustness and Discussion
Škraba, P., Rosen, P., Wang, B., et al. (2016) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2534538 · Cited by 15
Hierarchical Forman Triangulation: A multiscale model for scalar field analysis
Iuricich, F., & Floriani, L. D. (2017) · Computers & Graphics · doi:10.1016/j.cag.2017.05.015 · Cited by 15
A study on topological descriptors for the analysis of 3D surface texture
Zeppelzauer, M., Zieliński, B., Juda, M., & Seidl, M. (2017) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2017.10.012 · Cited by 15
Ghahremani, M., Yoo, J., Chung, S. J., Yoo, K., Ye, J. C., & Jeong, Y. (2018) · Journal of Movement Disorders · doi:10.14802/jmd.17061 · Cited by 15
Computing multiparameter persistent homology through a discrete Morse-based approach
Scaramuccia, S., Iuricich, F., Floriani, L. D., & Landi, C. (2020) · Computational Geometry · doi:10.1016/j.comgeo.2020.101623 · Cited by 23
Dey, T. K., Wang, J., & Wang, Y. (2019) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/3347146.3359348 · Cited by 15
Bridge detection in grid terrains and improved drainage enforcement
Carlson, R., & Danner, A. (2010) · ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems · doi:10.1145/1869790.1869827 · Cited by 16
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
