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 901–1,000 of 1,811
Unsupervised trajectory compression
Corcoran, P., Mooney, P., & Huang, G. P. (2016) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2016.7487479 · Cited by 6
Simplifying Massive Contour Maps
Arge, L., Deleuran, L. K., Mølhave, T., et al. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33090-2_10 · Cited by 6
Contributions to Persistence Theory
Du, D. (2014) · Annals of West University of Timisoara - Mathematics and Computer Science · doi:10.2478/awutm-2014-0012 · Cited by 6
Measuring Distance between Reeb GraphsPreprint
Bauer, U., Ge, X., & Wang, Y. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.2839 · Cited by 6
Stability in multidimensional Size TheoryPreprint
Cerri, A., Frosini, P., & Landi, C. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0608009 · Cited by 6
Vietoris-Rips Complexes of Regular PolygonsPreprint
Adams, H., Chowdhury, S., Jaffe, A. Q., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.10971 · Cited by 6
Blumberg, A. J., Gal, I., Mandell, M. A., et al. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.4581 · Cited by 6
Topology of deep neural networksPreprint
Naitzat, G., Zhitnikov, A., & Lim, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.06093 · Cited by 92
The stability of persistent homology of hypergraphsPreprint
Ren, S., & Wu, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.02237 · Cited by 6
Mutations strengthened SARS-CoV-2 infectivityPreprint
Chen, J., Wang, R., Wang, M., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.14669 · Cited by 6
Positivity of Multiparameter Persistence Diagrams and Bottleneck StabilityPreprint
McCleary, A., & Patel, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.13220 · Cited by 6
Approximation algorithms for 1-Wasserstein distance between persistence diagramsPreprint
Chen, S., & Wang, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.07710 · Cited by 6
Persistence in discrete Morse theory
Bauer, U. (2011) · eDiss (Georg-August-Universität Göttingen) · doi:10.53846/goediss-2536 · Cited by 18
The topological properties of the protein universe
Madsen, C. D., Barbensi, A., Zhang, S. Y., Ham, L., David, A., Pires, D. E. V., & Stumpf, M. P. H. (2025) · Nature Communications · doi:10.1038/s41467-025-61108-2 · Cited by 7
Enhanced perfusion following exposure to radiotherapy: A theoretical investigation
Köry, J., Narain, V., Stolz, B. J., et al. (2024) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1011252 · Cited by 5
A topology-aware multiscale feature fusion network for EEG-based motor imagery decoding
Shen, C., & Namiki, A. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.114540 · Cited by 5
Ren, Y., & Wei, G. (2025) · Advanced Intelligent Discovery · doi:10.1002/aidi.202500207 · Cited by 5
Wang, M., Wang, Y., Islam, M., Wang, Y., Wang, Y., Hwang, J., & Fan, Y. (2026) · npj Computational Materials · doi:10.1038/s41524-026-01997-z · Cited by 5
TDA-Clustering Strategies for the Characterization of Brain Organoids
Martin, C. B., Simon-Chane, C., Clouchoux, C., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-23223-7_10 · Cited by 5
Zabaleta-Ortega, Á., Masoller, C., & Guzmán-Vargas, L. (2023) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0167523 · Cited by 5
Persistent Homology and Persistent Cohomology: A Review
Okediji, B. A. (2024) · Earthline Journal of Mathematical Sciences · doi:10.34198/ejms.14224.349378 · Cited by 6
TG-Pose: Delving Into Topology and Geometry for Category-Level Object Pose Estimation
Zhan, Y., Wang, X., Nie, L., et al. (2024) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2024.3398291 · Cited by 5
Guo, H., & Schrader, P. T. (2025) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero63441.2025.11068413 · Cited by 6
Higher Dimensional Moore Bounds
Goff, M. (2010) · Graphs and Combinatorics · doi:10.1007/s00373-010-0979-9 · Cited by 5
Mathematical Foundations in Visualization
Hotz, I., Bujack, R., Garth, C., & Wang, B. (2020) · Springer eBooks · doi:10.1007/978-3-030-34444-3_5 · Cited by 6
Persistent Homology Metrics Reveal Quantum Fluctuations and Reactive Atoms in Path Integral Dynamics
Hu, Y., Ounkham, P., Maršálek, O., Markland, T. E., Krishmoorthy, B., & Clark, A. E. (2021) · Frontiers in Chemistry · doi:10.3389/fchem.2021.624937 · Cited by 5
Statistical Embedding: Beyond Principal Components
Tjøstheim, D., Jullum, M., & Løland, A. (2023) · Statistical Science · doi:10.1214/22-sts881 · Cited by 6
A Topological Similarity Measure Between Multi-Resolution Reeb Spaces
Ramamurthi, Y., Agarwal, T., & Chattopadhyay, A. (2021) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2021.3087273 · Cited by 5
Multipath cohomology of directed graphs
Caputi, L., Collari, C., & Trani, S. D. (2024) · Algebraic & Geometric Topology · doi:10.2140/agt.2024.24.4373 · Cited by 5
Exploring geographic hotspots using topological data analysis
Zhang, R., Lukasczyk, J., Wang, F., et al. (2021) · Transactions in GIS · doi:10.1111/tgis.12816 · Cited by 5
Decomposing filtered chain complexes: Geometry behind barcoding algorithms
Chachólski, W., Giunti, B., Jin, A., & Landi, C. (2022) · Computational Geometry · doi:10.1016/j.comgeo.2022.101938 · Cited by 10
Manuchehrfar, F., Li, H., Ma, A., & Liang, J. (2022) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.2c07015 · Cited by 5
Some recent trends in embeddings of time series and dynamic networks
Tjøstheim, D., Jullum, M., & Løland, A. (2023) · Journal of Time Series Analysis · doi:10.1111/jtsa.12677 · Cited by 5
Persistent Homology for RNA Data Analysis
Xia, K., Liu, X., & Wee, J. (2023) · Methods in molecular biology · doi:10.1007/978-1-0716-2974-1_12 · Cited by 5
VESTEC: Visual Exploration and Sampling Toolkit for Extreme Computing
Flatken, M., Podobas, A., Fellegara, R., Basermann, A., Holke, J., Knapp, D., Kontak, M., Krullikowski, C., Nolde, M., Brown, N., et al. (2023) · IEEE Access · doi:10.1109/access.2023.3301177 · Cited by 5
First Demonstration Experiment for Energy-Trading System EDISON-X Using the XRP Ledger
Ikeda, Y., Ohki, Y., Marquardt, Z., et al. (2023) · doi:10.7566/jpscp.40.011008 · Cited by 5
The Singular Support of Sheaves Is γ-Coisotropic
Guillermou, S., & Viterbo, C. (2024) · Geometric and Functional Analysis · doi:10.1007/s00039-024-00682-x · Cited by 5
Quantum topological data analysis via the estimation of the density of states
Scali, S., Umeano, C., & Kyriienko, O. (2024) · Physical Review A · doi:10.1103/physreva.110.042616 · Cited by 11
Persistent Homology in Medical Image Processing: A Literature Review
Brito-Pacheco, D., Giannopoulos, P., & Reyes‐Aldasoro, C. C. (2026) · ACM Transactions on Computing for Healthcare · doi:10.1145/3820762 · Cited by 6
The Offset Filtration of Convex Objects
Halperin, D., Kerber, M., & Shaharabani, D. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48350-3_59 · Cited by 6
A Randomized Subdivision Algorithm for Determining the Topology of Nodal Sets
Cochran, G. S., Wanner, T., & Dłotko, P. (2013) · SIAM Journal on Scientific Computing · doi:10.1137/120903154 · Cited by 5
A collaborative visual analytics suite for protein folding research
Harvey, W., Park, I., Rübel, O., Pascucci, V., Bremer, P., Li, C., & Wang, Y. (2014) · Journal of Molecular Graphics and Modelling · doi:10.1016/j.jmgm.2014.06.003 · Cited by 5
Reeb Spaces and the Robustness of Preimages
Patel, A. (2010) · Cited by 5
Using Persistent Homology to Represent Online Social Network Graphs
Lee, C. S. G., Gao, T., & Li, F. (2017) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass.2017.98 · Cited by 5
Evolution of local motifs and topological proximity in self-assembled quasi-crystalline phases
Pedersen, M. C., Robins, V., Mortensen, K., et al. (2020) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2020.0170 · Cited by 5
TopoMap: A 0-dimensional Homology Preserving Projection of High-Dimensional Data
Doraiswamy, H., Tierny, J., Silva, P. J. S., Nonato, L. G., & Silva, C. (2020) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2020.3030441 · Cited by 4
Ignacio, P. S., Bulauan, J.-A., & Uminsky, D. (2020) · Algorithms · doi:10.3390/a13110291 · Cited by 5
Ness-Cohn, E., & Braun, R. (2021) · Bioinformatics · doi:10.1093/bioinformatics/btab476 · Cited by 5
Phenotyping OSA: a time series analysis using fuzzy clustering and persistent homology
Loliencar, P., & Heo, G. (2021) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2021.10.012 · Cited by 5
Persistence of Conley--Morse Graphs in Combinatorial Dynamical Systems
Dey, T. K., Mrożek, M., & Slechta, R. (2022) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/21m143162x · Cited by 7
Stable topological summaries for analyzing the organization of cells in a packed tissue
Atienza, N., Jiménez, M.-J., & Soriano-Trigueros, M. (2021) · Deposito de Investigacion Universidad de Sevilla (University of Seville) · Cited by 5
Introduction to Persistent Homology
Virk, Ž. (2022) · doi:10.51939/0002 · Cited by 5
User dynamic topology-information-based matrix factorization for e-government recommendation
Sun, N., Chen, T., Luo, Q., & Ran, L. (2022) · Applied Soft Computing · doi:10.1016/j.asoc.2022.108993 · Cited by 6
tachyon : Efficient Shared Memory Parallel Computation of Extremum Graphs
Ande, A., Subhash, V., & Natarajan, V. (2023) · Computer Graphics Forum · doi:10.1111/cgf.14784 · Cited by 5
Persistent homological cell tracking technology
Oda, H., Tonami, K., Nakata, Y., Takubo, N., & Kurihara, H. (2023) · Scientific Reports · doi:10.1038/s41598-023-37760-3 · Cited by 6
Computing persistent homology with various coefficient fields in a single pass
Boissonnat, J.-D., & Maria, C. (2019) · Journal of Applied and Computational Topology · doi:10.1007/s41468-019-00025-y · Cited by 5
Genovese, C. R., Perone-Pacifico, M., Verdinelli, I., & Wasserman, L. (2016) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2016.1260472 · Cited by 5
Persistent Betti Numbers for a Noise Tolerant Shape-Based Approach to Image Retrieval
Frosini, P., & Landi, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23672-3_36 · Cited by 5
Winter, P., Sterner, H., & Sterner, P. (2009) · doi:10.1109/isvd.2009.25 · Cited by 5
A point calculus for interlevel set homology
Bendich, P. L., Cabello, S., & Edelsbrunner, H. (2011) · Pattern Recognition Letters · doi:10.1016/j.patrec.2011.10.007 · Cited by 5
ADVANCES IN MULTIDIMENSIONAL SIZE THEORY
Cerri, A., & Frosini, P. (2011) · Image Analysis & Stereology · doi:10.5566/ias.v29.p19-26 · Cited by 4
Topological persistence on a Jordan curve
Zheng, Y., Gu, S., & Tomasi, C. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288718 · Cited by 5
Computing Persistence Modules on Commutative Ladders of Finite Type
Escolar, E. G., & Hiraoka, Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44199-2_25 · Cited by 5
Defining and Computing Topological Persistence for 1-cocyclesPreprint
Burghelea, D., Dey, T. K., & Dong, D. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.3763 · Cited by 4
Stability of multidimensional persistent homology with respect to domain perturbationsPreprint
Frosini, P., & Landi, C. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.1078 · Cited by 5
Using cycles in high dimensional data to analyze protein bindingPreprint
Kovačev-Nikolić, V., Bubenik, P., Nikolić, D., & Heo, G. (2014) · arXiv (Cornell University) · Cited by 5
Weighted persistent homology for biomolecular data analysisPreprint
Meng, Z., Anand, D. V., Lu, Y., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02890 · Cited by 5
Multiscale Topology Characterises Dynamic Tumour Vascular NetworksPreprint
Stolz, B. J., Kaeppler, J., Markelc, B., Mech, F., Lipsmeier, F., Muschel, R. J., Byrne, H. M., & Harrington, H. A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.08667 · Cited by 7
Stable Invariants for Multiparameter PersistencePreprint
Gäfvert, O., & Chachólski, W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.03632 · Cited by 5
Top-K Exterior Power Persistent Homology: Algorithm, Structure, and Stability
Maruyama, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-15621-1_7 · Cited by 4
TopoAttn-Nets: Topological Attention in Graph Representation Learning
Chen, Y., Sizikova, E., & Gel, Y. R. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-26390-3_19 · Cited by 4
Mild explocivity, persistent homology and cryptocurrencies' bubbles: An empirical exercise
Arvanitis, S., & Detsis, M. (2023) · AIMS Mathematics · doi:10.3934/math.2024045 · Cited by 4
Classification of Schizophrenia EEG recording using homological features
Poetto, S., & Duch, W. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10650296 · Cited by 5
Persistent homology of featured time series data and its applications
Heo, E., & Jung, J.-H. (2024) · AIMS Mathematics · doi:10.3934/math.20241315 · Cited by 7
Structural Feature Extraction via Topological Data Analysis
Wang, B., Feng, B., Lv, L., Li, S., & Pan, F. M. (2025) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.5c01831 · Cited by 4
Gu, P., Wang, H., Zhang, Y., Li, H., Wang, C., & Chen, D. Z. (2025) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3746027.3755546 · Cited by 4
Computing highly occluded paths using a sparse network
Lebeck, N., Mølhave, T., & Agarwal, P. K. (2014) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/2666310.2666394 · Cited by 4
Optimal General Simplification of Scalar Fields on Surfaces
Tierny, J., Günther, D., & Pascucci, V. (2014) · Mathematics and visualization · doi:10.1007/978-3-662-44900-4_4 · Cited by 4
Exploration of Empty Space among Spherical Obstacles via Additively Weighted Voronoi Diagram
Maňák, M. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12980 · Cited by 4
Filtration Simplification for Persistent Homology via Edge Contraction
Dey, T. K., & Slechta, R. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14085-4_8 · Cited by 4
Topological information retrieval with dilation-invariant bottleneck comparative measures
Cao, Y., Monod, A., Vlontzos, A., Schmidtke, L., & Kainz, B. (2023) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaad022 · Cited by 4
Multilevel Robustness for 2D Vector Field Feature Tracking, Selection and Comparison
Yan, L. F., Ullrich, P. A., Roekel, L. P. V., et al. (2023) · Computer Graphics Forum · doi:10.1111/cgf.14799 · Cited by 4
Simplicial complex entropy for time series analysis
Guzmán-Vargas, L., Zabaleta-Ortega, Á., & Guzmán-Sáenz, A. (2023) · Scientific Reports · doi:10.1038/s41598-023-49958-6 · Cited by 5
Kadeethum, T., & Downs, C. (2024) · Remote Sensing · doi:10.3390/rs16122116 · Cited by 3
Universal distances for extended persistence
Bauer, U., Botnan, M. B., & Fluhr, B. (2024) · Journal of Applied and Computational Topology · doi:10.1007/s41468-024-00184-7 · Cited by 4
A comprehensive review of deep neural network interpretation using topological data analysis
Zhang, B., He, Z., & Lin, H. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.128513 · Cited by 13
Topology Unveiled: A New Horizon for Economic and Financial Modeling
Wei, Y., Watada, J., & Wang, Z. (2025) · Mathematics · doi:10.3390/math13020325 · Cited by 5
Acoustic tags versus camera—a case study on feeding behaviour of European seabass in sea cages
Chen, I.-H., Georgopoulou, D. G., Ebbesson, L. O. E., et al. (2025) · Frontiers in Marine Science · doi:10.3389/fmars.2024.1497336 · Cited by 4
Zia, M., Jones, B., Feng, H., & Wei, G. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00074 · Cited by 6
Persistent homology for structural characterization in disordered systems
Wang, A., & Zou, L. (2025) · Physical review. E · doi:10.1103/physreve.111.045306 · Cited by 9
Human perception faithful curve reconstruction based on persistent homology and principal curve
Chen, Y., Lin, H., & Xing, Y. (2025) · Graphical Models · doi:10.1016/j.gmod.2025.101267 · Cited by 4
I/O-Efficient Algorithms for Computing Contours on a Terrain
Agarwal, P. K., Arge, L., Mølhave, T., et al. (2008) · Cited by 4
Gamble, J., Lagravère, M. O., Major, P. W., et al. (2012) · Korean Journal of Radiology · doi:10.3348/kjr.2012.13.2.126 · Cited by 4
Stable Comparison of Multidimensional Persistent Homology Groups with Torsion
Frosini, P. (2012) · Acta Applicandae Mathematicae · doi:10.1007/s10440-012-9769-0 · Cited by 4
Shape Simplification Through Graph Sparsification
Escolano, F. J., Curado, M., Biasotti, S., et al. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-58961-9_2 · Cited by 4
Sclow Plots: Visualizing Empty Space
Giesen, J., Kühne, L., & Lucas, P. (2017) · Computer Graphics Forum · doi:10.1111/cgf.13175 · Cited by 4
Interactions Between Kernels, Frames, and Persistent Homology
Guillemard, M., & Iske, A. (2017) · Applied and numerical harmonic analysis · doi:10.1007/978-3-319-55556-0_14 · Cited by 5
Performance enhancement of a computational persistent homology package
Hylton, A., Henselman‐Petrusek, G., Sang, J., & Short, R. (2017) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/pccc.2017.8280468 · Cited by 4
Data-driven analysis of pareto set topology
Hamada, N., & Goto, K. (2018) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3205455.3205613 · Cited by 4
PHom-GeM: Persistent Homology for Generative Models
Charlier, J., State, R., & Hilger, J. (2019) · Swiss Conference on Data Science (SDS) · doi:10.1109/sds.2019.000-1 · Cited by 4
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
