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
0 of 8 cited sources checked · 0 supported · 0 flagged
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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearA 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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).
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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).
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt 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
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Induced homology maps are described as injective despite cycle deaths
MinorAn injective map from an earlier homology group cannot send one of its nonzero classes to zero. The paper also says that later negative simplices cancel classes created earlier, so the homology maps it describes cannot generally be injective.
“The p-persistent homology groups can also be defined using injective homomorphisms between ordinary homology groups.”
“Note that as we increase p, negative simplices cancel positive simplices earlier in the filtration.”
One reported average list length exceeds average persistence
MinorFor G's 2-cycles, Table 4 gives an average list length of 4.86, while Table 5 gives an average persistence of 4.47. Thus the stated comparison does not hold for that dataset and cycle dimension.
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
“| 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
Flagged first, then by citations
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 301–400 of 1,811
Extreme elevation on a 2-manifold
Agarwal, P. K., Edelsbrunner, H., Harer, J., & Wang, Y. (2004) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/997817.997871 · Cited by 45
Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data
Saikia, H., Seidel, H., & Weinkauf, T. (2014) · Computer Graphics Forum · doi:10.1111/cgf.12360 · Cited by 44
Augmented Topological Descriptors of Pore Networks for Material Science
Ushizima, D. M., Morozov, D., Weber, G. H., et al. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.200 · Cited by 44
Multivariate Data Analysis Using Persistence-Based Filtering and Topological Signatures
Rieck, B., Mara, H., & Leitte, H. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.248 · Cited by 42
Smooth Shape‐Aware Functions with Controlled Extrema
Jacobson, A., Weinkauf, T., & Sorkine‐Hornung, O. (2012) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2012.03163.x · Cited by 47
Mittal, K., & Gupta, S. (2017) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4983840 · Cited by 44
Demonstration of topological data analysis on a quantum processor
Huang, H.-L., Wang, X., Rohde, P. P., Luo, Y.-H., Zhao, Y., Liu, C., Li, L., Liu, N.-L., Lu, C., & Pan, J.-W. (2018) · Optica · doi:10.1364/optica.5.000193 · Cited by 47
Random partial paired comparison for subjective video quality assessment via hodgerank
Xu, Q., Jiang, T., Yao, Y., et al. (2011) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/2072298.2072350 · Cited by 44
Fast Combinatorial Vector Field Topology
Reininghaus, J., Löwen, C., & Hotz, I. (2010) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2010.235 · Cited by 43
Persistent homology for kernels, images, and cokernels
Cohen‐Steiner, D., Edelsbrunner, H., Harer, J., & Morozov, D. (2009) · doi:10.5555/1496770.1496880 · Cited by 41
Salient critical points for meshes
Liu, Y.-S., Liu, M., Kihara, D., et al. (2007) · ACM Symposium on Solid and Physical Modeling (SPM) · doi:10.1145/1236246.1236285 · Cited by 43
Statistical topology via Morse theory persistence and nonparametric estimation
Bubenik, P., Carlsson, G., Kim, P. T., & Luo, Z. (2010) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/516/10167 · Cited by 44
Structure and Stability of the One-Dimensional Mapper
Carrière, M., & Oudot, S. (2017) · Foundations of Computational Mathematics · doi:10.1007/s10208-017-9370-z · Cited by 42
Multiscale Persistent Functions for Biomolecular Structure Characterization
Xia, K., Li, Z., & Mu, L. (2017) · Bulletin of Mathematical Biology · doi:10.1007/s11538-017-0362-6 · Cited by 40
Homological percolation and the Euler characteristic
Bobrowski, O., & Škraba, P. (2020) · Physical review. E · doi:10.1103/physreve.101.032304 · Cited by 39
Topological Data Analysis of Functional MRI Connectivity in Time and Space Domains
Anderson, K. L., Anderson, J. S., Palande, S., & Wang, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00755-3_8 · Cited by 40
Progressive Wasserstein Barycenters of Persistence Diagrams
Vidal, J., Budin, J., & Tierny, J. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2019.2934256 · Cited by 41
Persistent homology of the cosmic web – I. Hierarchical topology in ΛCDM cosmologies
Wilding, G., Nevenzeel, K., van de Weygaert, R., et al. (2021) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stab2326 · Cited by 41
Multiscale topology characterizes dynamic tumor vascular networks
Stolz, B. J., Kaeppler, J., Markelc, B., Braun, F., Lipsmeier, F., Muschel, R. J., Byrne, H. M., & Harrington, H. A. (2022) · Science Advances · doi:10.1126/sciadv.abm2456 · Cited by 51
Efficient Computation of Combinatorial Feature Flow Fields
Reininghaus, J., Kasten, J., Weinkauf, T., et al. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.269 · Cited by 41
Interface surfaces for protein-protein complexes
Ban, Y. A., Edelsbrunner, H., & Rudolph, J. (2006) · Journal of the ACM · doi:10.1145/1147954.1147957 · Cited by 41
The Persistent Homology of a Self-Map
Edelsbrunner, H., Jabłoński, G., & Mrożek, M. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9223-y · Cited by 41
Topological Persistence for Circle-Valued Maps
Burghelea, D., & Dey, T. K. (2013) · Discrete & Computational Geometry · doi:10.1007/s00454-013-9497-x · Cited by 43
Persistence Atlas for Critical Point Variability in Ensembles
Favelier, G., Faraj, N., Summa, B., & Tierny, J. (2018) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2864432 · Cited by 38
Task-Based Augmented Contour Trees with Fibonacci Heaps
Gueunet, C., Pierre, F., Jomier, J., et al. (2019) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2898436 · Cited by 40
Ren, S., Wu, C., & Wu, J. (2018) · Rocky Mountain Journal of Mathematics · doi:10.1216/rmj-2018-48-8-2661 · Cited by 38
Simplicial Models and Topological Inference in Biological Systems
Nanda, V., & Sazdanović, R. (2013) · Natural computing series · doi:10.1007/978-3-642-40193-0_6 · Cited by 42
Lifted Wasserstein Matcher for Fast and Robust Topology Tracking
Soler, M., Plainchault, M., Conche, B., & Tierny, J. (2018) · Université Pierre et Marie CURIE (UPMC) · Cited by 40
Simplicial and topological descriptions of human brain dynamics
Billings, J., Saggar, M., Hlinka, J., Keilholz, S. D., & Petri, G. (2021) · Network Neuroscience · doi:10.1162/netn_a_00190 · Cited by 42
Discrete Morse Theory for Computing Cellular Sheaf Cohomology
Curry, J. M., Ghrist, R., & Nanda, V. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-015-9266-8 · Cited by 37
Machine learning methods for protein-protein binding affinity prediction in protein design
Guo, Z., & Yamaguchi, R. (2022) · Frontiers in Bioinformatics · doi:10.3389/fbinf.2022.1065703 · Cited by 41
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
Boissonnat, J., Dey, T. K., & Maria, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40450-4_59 · Cited by 38
Quantitative and interpretable order parameters for phase transitions from persistent homology
Cole, A., Loges, G. J., & Shiu, G. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.104426 · Cited by 45
Wasserstein Distances, Geodesics and Barycenters of Merge Trees
Pont, M., Vidal, J., Delon, J., & Tierny, J. (2021) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2021.3114839 · Cited by 38
Coreduction homology algorithm for inclusions and persistent homology
Mrożek, M., & Wanner, T. (2010) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2010.09.036 · Cited by 38
An output-sensitive algorithm for persistent homology
Chen, C., & Kerber, M. (2012) · Computational Geometry · doi:10.1016/j.comgeo.2012.02.010 · Cited by 38
A fast algorithm for constructing topological structure in large data
Liu, X., Xie, Z. Y., & Yi, D. (2012) · Homology Homotopy and Applications · doi:10.4310/hha.2012.v14.n1.a11 · Cited by 30
Coreduction Homology Algorithm for Regular CW-Complexes
Dłotko, P., Kaczyński, T., Mrożek, M., et al. (2010) · Discrete & Computational Geometry · doi:10.1007/s00454-010-9303-y · Cited by 37
Anand, D. V., Meng, Z., Xia, K., & Mu, Y. (2020) · Scientific Reports · doi:10.1038/s41598-020-66710-6 · Cited by 41
Growing Least Squares for the Analysis of Manifolds in Scale‐Space
Mellado, N., Guennebaud, G., Barla, P., et al. (2012) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2012.03174.x · Cited by 37
Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes
Boissonnat, J.-D., Guibas, L. J., & Oudot, S. (2009) · Discrete & Computational Geometry · doi:10.1007/s00454-009-9175-1 · Cited by 37
Recognizing geometric primitives in 3D point clouds of mechanical CAD objects
Romanengo, C., Raffo, A., Biasotti, S., et al. (2023) · Computer-Aided Design · doi:10.1016/j.cad.2023.103479 · Cited by 36
A Riemannian Framework for Statistical Analysis of Topological Persistence Diagrams
Anirudh, R., Venkataraman, V., Ramamurthy, K. N., & Turaga, P. K. (2016) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2016.132 · Cited by 37
Siddiqui, S., Shikotra, A., Richardson, M., Doran, E., Choy, D. F., Bell, A. G., Austin, C. D., Eastham‐Anderson, J., Hargadon, B., Arron, J. R., et al. (2018) · Journal of Allergy and Clinical Immunology · doi:10.1016/j.jaci.2017.12.982 · Cited by 37
Localized Topological Simplification of Scalar Data
Lukasczyk, J., Garth, C., Maciejewski, R., et al. (2020) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2020.3030353 · Cited by 36
Assessment of skin barrier function using skin images with topological data analysis
Koseki, K., Kawasaki, H., Atsugi, T., Nakanishi, M., Mizuno, M., Naru, E., Ebihara, T., Amagai, M., & Kawakami, E. (2020) · npj Systems Biology and Applications · doi:10.1038/s41540-020-00160-8 · Cited by 36
Active phase discovery in heterogeneous catalysis via topology-guided sampling and machine learning
Zheng, S., Zhang, X.-M., Liu, H.-S., Liang, G.-H., Zhang, S.-W., Zhang, W., Wang, B., Yang, J., Jin, X., Pan, F. M., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-57824-4 · Cited by 37
Topological persistence machine of phase transitions
Tran, Q. H., Chen, M., & Hasegawa, Y. (2021) · Physical review. E · doi:10.1103/physreve.103.052127 · Cited by 42
Quantum algorithm for persistent Betti numbers and topological data analysis
Hayakawa, R. (2022) · Quantum · doi:10.22331/q-2022-12-07-873 · Cited by 40
Simplex and Diamond Hierarchies: Models and Applications
Weiss, K. G., & Floriani, L. D. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01853.x · Cited by 35
Stability of Critical Points with Interval Persistence
Dey, T. K., & Wenger, R. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-1356-1 · Cited by 32
Quantifying Transversality by Measuring the Robustness of Intersections
Edelsbrunner, H., Morozov, D., & Patel, A. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9090-8 · Cited by 34
Symmetry in Scalar Field Topology
Thomas, D. M., & Natarajan, V. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.236 · Cited by 35
Topological Data Analysis for Multivariate Time Series Data
El-Yaagoubi, A. B., Chung, M. K., & Ombao, H. (2023) · Entropy · doi:10.3390/e25111509 · Cited by 45
Unexpected topology of the temperature fluctuations in the cosmic microwave background
Pranav, P., Adler, R. J., Buchert, T., et al. (2019) · Astronomy and Astrophysics · doi:10.1051/0004-6361/201834916 · Cited by 34
PI-Net: A Deep Learning Approach to Extract Topological Persistence Images
Som, A., Choi, H., Ramamurthy, K. N., Buman, M. P., & Turaga, P. K. (2020) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw50498.2020.00425 · Cited by 37
Image Segmentation Using Topological Persistence
Letscher, D., & Fritts, J. E. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74272-2_73 · Cited by 34
Sparse-TDA: Sparse Realization of Topological Data Analysis for Multi-Way Classification
Guo, W., Manohar, K., Brunton, S. L., et al. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2790386 · Cited by 34
Moraleda, R. R., Xiong, W., Halama, N., Breitkopf‐Heinlein, K., Dooley, S., Salinas, L., Heermann, D. W., & Valous, N. A. (2017) · Medical Image Analysis · doi:10.1016/j.media.2017.02.009 · Cited by 33
Caging Grasps of Rigid and Partially Deformable 3-D Objects With Double Fork and Neck Features
Varava, A., Kragić, D., & Pokorny, F. T. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2602374 · Cited by 33
Geometric and Topological Inference
Boissonnat, J., Chazal, F., & Yvinec, M. (2018) · Cambridge University Press eBooks · doi:10.1017/9781108297806 · Cited by 31
Topologically Controlled Lossy Compression
Soler, M., Plainchault, M., Conche, B., & Tierny, J. (2018) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2018.00015 · Cited by 31
Topological Machine Learning with Persistence Indicator Functions
Rieck, B., Sadlo, F., & Leitte, H. (2020) · Mathematics and visualization · doi:10.1007/978-3-030-43036-8_6 · Cited by 39
Protein-Folding Analysis Using Features Obtained by Persistent Homology
Ichinomiya, T., Obayashi, I., & Hiraoka, Y. (2020) · Biophysical Journal · doi:10.1016/j.bpj.2020.04.032 · Cited by 33
Fit4CAD: A point cloud benchmark for fitting simple geometric primitives in CAD objects
Romanengo, C., Raffo, A., Qie, Y., et al. (2021) · Computers & Graphics · doi:10.1016/j.cag.2021.09.013 · Cited by 33
Benzekry, S., Tuszyński, J. A., Rietman, E. A., et al. (2015) · Biology Direct · doi:10.1186/s13062-015-0058-5 · Cited by 33
Uncovering the Topology of Time-Varying fMRI Data using Cubical PersistencePreprint
Rieck, B., Yates, T. S., Bock, C., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.07882 · Cited by 33
Dey, T. K., Shi, D., & Wang, Y. (2019) · ACM Journal of Experimental Algorithmics · doi:10.1145/3284360 · Cited by 37
Distance between extremum graphs
Narayanan, V., Thomas, D. M., & Natarajan, V. (2015) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2015.7156386 · Cited by 32
Multiparameter Hierarchical Clustering Methods
Carlsson, G., & Mémoli, F. (2010) · Studies in classification, data analysis, and knowledge organization · doi:10.1007/978-3-642-10745-0_6 · Cited by 31
A Scale Space Based Persistence Measure for Critical Points in 2D Scalar Fields
Reininghaus, J., Kotava, N., Günther, D., Kasten, J., Hagen, H., & Hotz, I. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.159 · Cited by 31
Persistence codebooks for topological data analysis
Zieliński, B., Lipiński, M., Juda, M., Zeppelzauer, M., & Dłotko, P. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-020-09897-4 · Cited by 34
A Framework for Differential Calculus on Persistence Barcodes
Leygonie, J., Oudot, S., & Tillmann, U. (2021) · Foundations of Computational Mathematics · doi:10.1007/s10208-021-09522-y · Cited by 36
Data Polygamy: The Many-Many Relationships among Urban Spatio-Temporal Data Sets
Chirigati, F., Doraiswamy, H., Damoulas, T., et al. (2016) · Warwick Research Archive Portal (University of Warwick) · doi:10.48550/arxiv.1610.06978 · Cited by 31
Topological Descriptors of Histology Images
Singh, N. P., Couture, H. D., Marron, J. S., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10581-9_29 · Cited by 31
Fast and Memory-Efficienty Topological Denoising of 2D and 3D Scalar Fields
Günther, D., Jacobson, A., Reininghaus, J., et al. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2014.2346432 · Cited by 31
Video-based descriptors for object recognition
Lee, T., & Soatto, S. (2011) · Image and Vision Computing · doi:10.1016/j.imavis.2011.08.003 · Cited by 29
Towards Robust Topology of Sparsely Sampled Data
Correa, C., & Lindström, P. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.245 · Cited by 31
A framework for mapping with biobotic insect networks: From local to global maps
Dirafzoon, A., Bozkurt, A. Y., & Lobaton, E. J. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.11.004 · Cited by 32
Zhang, Z., Yang, S., Cui, H., Wu, J. J., Schwartz, F., & Qi, H. (2016) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2016.2634531 · Cited by 31
Topological Graph Neural Networks
Horn, M., De Brouwer, E., Moor, M., Moreau, Y., Rieck, B., & Borgwardt, K. (2021) · arXiv · doi:10.48550/arxiv.2102.07835 · Cited by 31
Leite, L. S. G., Banerjee, S., Wei, Y., et al. (2024) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.1729 · Cited by 30
2D Vector Field Simplification Based on Robustness
Škraba, P., Wang, B., Chen, G., et al. (2014) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2014.17 · Cited by 30
Fractal dimension estimation with persistent homology: A comparative study
Jaquette, J., & Schweinhart, B. (2019) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2019.105163 · Cited by 29
Persistent Dirac for molecular representation
Wee, J., Bianconi, G., & Xia, K. (2023) · Scientific Reports · doi:10.1038/s41598-023-37853-z · Cited by 33
Persistence based online signal and trajectory simplification for mobile devices
Katsikouli, P., Sarkar, R., & Gao, J. (2014) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/2666310.2666388 · Cited by 30
A kernel for multi-parameter persistent homology
Corbet, R., Fugacci, U., Kerber, M., Landi, C., & Wang, B. (2019) · Computers & Graphics X · doi:10.1016/j.cagx.2019.100005 · Cited by 30
Simplicial Homology of Random Configurations
Decreusefond, L., Ferraz, E., Randriambololona, H., et al. (2014) · Advances in Applied Probability · doi:10.1239/aap/1401369697 · Cited by 30
Persistent homology analysis of ion aggregations and hydrogen-bonding networks
Xia, K. (2018) · Physical Chemistry Chemical Physics · doi:10.1039/c8cp01552j · Cited by 33
Spectral quadrangulation with orientation and alignment control
Huang, J., Zhang, M., Ma, J., et al. (2008) · ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia (SIGGRAPH Asia) · doi:10.1145/1457515.1409100 · Cited by 30
Guaranteed quality triangulation of molecular skin surfaces
Cheng, H.-L., & Shi, X. (2005) · IEEE Visualization · doi:10.1109/visual.2004.36 · Cited by 30
A Geometric Perspective on Sparse FiltrationsPreprint
Cavanna, N. J., Jahanseir, M., & Sheehy, D. R. (2015) · arXiv (Cornell University) · doi:10.4230/lipics.socg.2026.5 · Cited by 42
Crawford, L. A., Monod, A., Chen, A., et al. (2019) · Figshare · doi:10.6084/m9.figshare.10269596.v1 · Cited by 30
Wong, E., Palande, S., Wang, B., et al. (2016) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2016.7493506 · Cited by 29
TopoGCL: Topological Graph Contrastive Learning
Chen, Y., Frias, J., & Gel, Y. R. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i10.29026 · Cited by 31
Approximating cycles in a shortest basis of the first homology group from point data
Dey, T. K., Sun, J. Z., & Wang, Y. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/124004 · Cited by 27
Persistent homology and applied homotopy theory
Carlsson, G. (2020) · Chapman & Hall/CRC eBooks · doi:10.1201/9781351251624-8 · Cited by 30
Topological descriptor of thermal conductivity in amorphous Si
Minamitani, E., Shiga, T., Kashiwagi, M., et al. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0093441 · Cited by 29
Persistent Intersection Homology
Bendich, P. L., & Harer, J. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9081-1 · Cited by 26
Detecting Symmetry in Scalar Fields Using Augmented Extremum Graphs
Thomas, D. M., & Natarajan, V. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.148 · Cited by 29
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
