pith. sign in

arxiv: 2605.21636 · v1 · pith:KK4FMBUUnew · submitted 2026-05-20 · 💻 cs.CG · math.AT

Bifunction and Interlevel Delaunay Trifiltrations

\'Angel Javier Alonso , Michael Kerber , Tung Lam , Michael Lesnick , Abhishek Rathod This is my paper

Pith reviewed 2026-05-22 08:21 UTC · model grok-4.3

classification 💻 cs.CG math.AT
keywords Delaunay filtrationtrifiltrationbifunctionmulti-parameter persistencepoint cloudsoffset filtrationweak equivalencecomputational geometry
0
0 comments X

The pith

A three-parameter Delaunay trifiltration for point clouds with an R-squared function is weakly equivalent to the offset version.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs a three-parameter filtration that starts from a point cloud in Euclidean space where each point carries two real numbers. This bifunction Delaunay trifiltration is built so that its topological features match those of the more direct offset trifiltration formed by growing balls around the points. A reader would care because data often varies along two axes at once, and the Delaunay route yields a complex whose size is polynomial in the number of points rather than exponential in the parameters. The authors also supply an explicit algorithm together with code that processes thousands of points in three dimensions while keeping memory growth nearly linear.

Core claim

We introduce a 3-parameter extension of the Delaunay filtration for point clouds equipped with an R^2-valued function, also satisfying an analogous weak equivalence. For a point cloud X subset of R^d, our trifiltration has size O of the number of points raised to ceil of (d plus 1) over 2 plus 1. We present an algorithm that computes this trifiltration in time O of the number of points raised to ceil of d over 2 plus 2, together with an implementation whose memory grows nearly linearly on thousands of points in R^3.

What carries the argument

The bifunction Delaunay trifiltration, which augments the Delaunay complex with sublevel sets of the two functions to produce a 3-parameter structure that remains weakly equivalent to the offset trifiltration.

If this is right

  • Persistent homology can be computed in three parameters for function-augmented point clouds using a complex whose size remains polynomial in the input.
  • The equivalence property extends directly from the known one- and two-parameter results.
  • Practical implementations become feasible for data sets of several thousand points when the ambient dimension is three.
  • The size and time bounds are expressed explicitly in terms of the number of points and the ambient dimension d.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The construction could support tracking of shape changes in data that vary with both time and a second scalar measurement.
  • Higher-parameter versions might need separate proofs if the equivalence property does not carry over automatically.
  • The polynomial scaling suggests that approximations or sampling strategies would be useful when the ambient dimension grows.

Load-bearing premise

The three-parameter construction must preserve the same weak topological equivalence to the offset trifiltration that holds for the one- and two-parameter Delaunay cases, without new obstructions appearing.

What would settle it

A concrete point cloud in R^d together with an R^2 function for which the homology groups of the proposed trifiltration differ from those of the offset trifiltration at some triple of parameter values.

Figures

Figures reproduced from arXiv: 2605.21636 by Abhishek Rathod, \'Angel Javier Alonso, Michael Kerber, Michael Lesnick, Tung Lam.

Figure 1
Figure 1. Figure 1: Left: For a point set X ⊂ R 2 , the Voronoi decomposi￾tion Vor(X) (green) and the corresponding Delaunay triangulation Del(X) (dark blue). Right: The offset O(X)r (orange) and Delau￾nay complex D(X)r ⊂ Del(X) for a fixed radius r. In many TDA applications, the point cloud X comes equipped with a function δ : X → R [22, 20]. It is then natural to seek a refinement of the persistent homology of X that is sen… view at source ↗
Figure 2
Figure 2. Figure 2: Non-monotonicity of Delaunay triangulations of planar point clouds Xa, Xb = Xa ∪ {x}, Xc = Xa ∪ {y}, and Xd = Xa ∪ {x, y}. The points x and y are shown in green and red. Contributions. In this paper, we extend the results of [3] on sublevel￾Delaunay bifiltrations to functions γ : X → R 2 , where X ⊂ R d is in gen￾eral position. Specifically, we introduce the sublevel Delaunay and sublevel Delaunay-Čech tri… view at source ↗
Figure 3
Figure 3. Figure 3: Illustration of a conflict triple. Let σ ∈ Del(X(2,1)) be a 2-simplex with circumsphere S, as shown in green on the left. Assume that γ(σ) = (2, 1) and that x (red) and y (blue) are points of X lying inside S, with γ(x) = (3, 2) and γ(y) = (1, 3). Then letting p = (2, 2), the injectivity of γ2 implies that X(2,1) = Xp, so σ ∈ D(Xp). In addition, x ∈ Xp→ = X(3,2), so (σ, x) is a conflict pair at p. Similarl… view at source ↗
Figure 4
Figure 4. Figure 4: The Delaunay triangulation Del(Z) (blue), and the new point z (red). Triangles whose circumcircles contain z are shaded. We remove all these triangles, leaving an untriangulated star-convex region Σ centered at z. Σ is then retriangulated by the simplicial cone with base the boundary of Σ and apex z, yielding Del(Z ∪ {z}). Remark 5.1. Note that the definition of BW-conflict is distinct from, but closely re… view at source ↗
Figure 5
Figure 5. Figure 5: After inserting x into Del(W) to obtain Del(W ∪ {x}), the first phase of the local algorithm iteratively removes points of R = W \ Xγ(x)↓ that are Delaunay neighbors of x, until there are no such neighbors. The left figure shows Del(W ∪ {x}) and the right figure shows Del(W ∪ {x} \ Q), where Q is the set of removed points. The point x is shown as a red star, while the points of Q, R \ Q, and Xγ(x)↓ are sho… view at source ↗
Figure 6
Figure 6. Figure 6: For X = {0, 1, 3} with γ(0) = (1, 0), γ(1) = (0, 0), and γ(3) = (0, 1), the telescopic Voronoi ball T (1)(2,2),2 is shown as the blue shaded polyhedron. then (w, q) ∈ \ k i=1 T (xi)p,r. Therefore, we have a deformation retraction H of Tk i=1 T (xi)p,r onto Cγ(σ) × {γ(σ)} given by H((w, q), t) = (w,(1 − t)q + tγ(σ)). Note that Cγ(σ) is contractible, since it is a non-empty intersection of Voronoi balls, hen… view at source ↗
Figure 7
Figure 7. Figure 7: Log-log plots of complex size (top), memory consump￾tion in MB (middle), and time in seconds (bottom) as a function of input size |X|, for the computations reported in [PITH_FULL_IMAGE:figures/full_fig_p028_7.png] view at source ↗
read the original abstract

A key property of the Delaunay filtration is that it is topologically (i.e., weakly) equivalent to the offset (union-of-balls) filtration. Recently, this filtration has been extended to point clouds equipped with an $\mathbb{R}$-valued function, yielding a computable 2-parameter filtration that satisfies an analogous weak equivalence. Motivated in part by the study of time-varying data, we introduce a 3-parameter extension of the Delaunay filtration for point clouds equipped with an $\mathbb{R}^2$-valued function, also satisfying an analogous weak equivalence. For a point cloud $X \subset \mathbb{R}^d$, our trifiltration has size $O\bigl(|X|^{\lceil(d+1)/2\rceil+1}\bigr)$. We present an algorithm that computes this trifiltration in time $O\bigl(|X|^{\lceil d/2\rceil+2}\bigr)$, together with an implementation. Our experiments demonstrate that implementation can handle thousands of points in $\mathbb{R}^3$, with memory growth that is nearly linear.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The paper introduces a 3-parameter extension of the Delaunay filtration, called the bifunction and interlevel Delaunay trifiltration, for a point cloud X in R^d equipped with an R^2-valued function. It claims this trifiltration is weakly equivalent to the offset (union-of-balls) trifiltration, has size O(|X|^⌈(d+1)/2⌉+1), admits an algorithm running in O(|X|^⌈d/2⌉+2) time, and includes an implementation that scales to thousands of points in R^3 with nearly linear memory growth.

Significance. If the weak equivalence holds, the result would extend the topological guarantees of Delaunay filtrations to a 3-parameter setting relevant for time-varying or bifunction data, offering a computable alternative to the offset trifiltration with explicit size and runtime bounds that improve on naive constructions. The implementation results further indicate practical utility in low-dimensional computational geometry and topological data analysis.

major comments (1)
  1. The abstract claims that the trifiltration satisfies an analogous weak equivalence to the offset trifiltration, extending the 1- and 2-parameter cases. However, the manuscript provides no derivation details, proof sketch, or construction for this equivalence in the 3-parameter regime. This is load-bearing, as the additional interlevel direction can produce higher-codimension intersections whose coverage by the Delaunay complex is not obviously guaranteed by prior arguments.
minor comments (1)
  1. The experimental section reports handling thousands of points in R^3 with nearly linear memory growth, but lacks specific tables or plots quantifying the observed size versus the theoretical O(|X|^⌈(d+1)/2⌉+1) bound for the tested instances.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback. We address the major comment below and will revise the manuscript to strengthen the presentation of the weak equivalence.

read point-by-point responses

  1. Referee: The abstract claims that the trifiltration satisfies an analogous weak equivalence to the offset trifiltration, extending the 1- and 2-parameter cases. However, the manuscript provides no derivation details, proof sketch, or construction for this equivalence in the 3-parameter regime. This is load-bearing, as the additional interlevel direction can produce higher-codimension intersections whose coverage by the Delaunay complex is not obviously guaranteed by prior arguments.

    Authors: We agree that the current manuscript does not provide sufficient derivation details or a proof sketch for the weak equivalence in the 3-parameter case, and that this is a load-bearing claim. The equivalence is obtained by extending the standard Delaunay-to-offset inclusion and the nerve theorem arguments from the 1- and 2-parameter settings, with the interlevel direction handled by considering the product structure on the bifunction values and verifying that the Delaunay complex still captures the necessary higher-codimension intersections via the same convex-hull and empty-ball properties. In the revision we will add a dedicated subsection (or appendix) containing an explicit proof sketch that directly addresses the referee's concern about higher-codimension intersections. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper constructs a 3-parameter Delaunay trifiltration for point clouds with R²-valued functions and claims it satisfies weak equivalence to the offset trifiltration, extending the 1- and 2-parameter cases via explicit combinatorial and topological arguments. Size and runtime bounds follow directly from the complex's combinatorial structure in R^d. No quoted steps reduce a claimed result to a fitted parameter, self-definition, or load-bearing self-citation chain; the equivalence is derived as a new property of the presented construction rather than presupposed by renaming or ansatz from prior inputs. The work is self-contained against external benchmarks for the lower-parameter cases.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central contribution is a new filtration construction and algorithm; no free parameters are introduced. Relies on standard properties of Delaunay complexes and offset filtrations from prior literature.

axioms (1)
  • domain assumption The weak equivalence between Delaunay and offset filtrations extends analogously to the 3-parameter bifunction setting.
    Invoked as the motivating property carried over from the 2-parameter case described in the abstract.

pith-pipeline@v0.9.0 · 5729 in / 1239 out tokens · 28909 ms · 2026-05-22T08:21:03.989076+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

63 extracted references · 63 canonical work pages · 1 internal anchor

  1. [1]

    Topological data analysis of collective motion.SIAM News, 53(01), 2020

    Henry Adams, Veronica Ciocanel, Chad M Topaz, and Lori Ziegelmeier. Topological data analysis of collective motion.SIAM News, 53(01), 2020

    work page 2020

  2. [2]

    A sparse multicover bifiltration of linear size

    Ángel Javier Alonso. A sparse multicover bifiltration of linear size. In41st International Symposium on Computational Geometry (SoCG 2025), 2025

    work page 2025

  3. [3]

    Delaunay bifiltrations of functions on point clouds

    Ángel Javier Alonso, Michael Kerber, Tung Lam, and Michael Lesnick. Delaunay bifiltrations of functions on point clouds. InProceedings of the 2024 Annual ACM- SIAM Symposium on Discrete Algorithms, pages 4872–4891, Philadelphia, PA, January

    work page 2024

  4. [4]

    Society for Industrial and Applied Mathematics

    work page

  5. [5]

    Filtration-domination in bifiltered graphs

    Ángel Javier Alonso, Michael Kerber, and Siddharth Pritam. Filtration-domination in bifiltered graphs. In2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pages 27–38. SIAM, 2023

    work page 2023

  6. [6]

    The Morse theory of Čech and Delaunay complexes

    Ulrich Bauer and Herbert Edelsbrunner. The Morse theory of Čech and Delaunay complexes. Transactions of the American Mathematical Society, 369(5):3741–3762, 2017

    work page 2017

  7. [7]

    A unified view on the functorial nerve theorem and its variations.Expositiones Mathematicae, 41(4):125503, December 2023

    Ulrich Bauer, Michael Kerber, Fabian Roll, and Alexander Rolle. A unified view on the functorial nerve theorem and its variations.Expositiones Mathematicae, 41(4):125503, December 2023

    work page 2023

  8. [8]

    Athena Scientific, 2009

    Dimitri Bertsekas.Convex optimization theory, volume 1. Athena Scientific, 2009

    work page 2009

  9. [9]

    On the size of chromatic Delaunay mosaics.Discrete & Computational Geometry, 75(1):24–47, 2026

    Ranita Biswas, Sebastiano Cultrera di Montesano, Ondřej Draganov, Herbert Edels- brunner, and Morteza Saghafian. On the size of chromatic Delaunay mosaics.Discrete & Computational Geometry, 75(1):24–47, 2026

    work page 2026

  10. [10]

    Discrete & Computational Geometry, 68(4):949–963, 2022

    NelloBlaserandMortenBrun.Relativepersistenthomology. Discrete & Computational Geometry, 68(4):949–963, 2022

    work page 2022

  11. [11]

    Nello Blaser, Morten Brun, Odin Hoff Gardaa, and Lars M. Salbu. Core bifiltration. Journal of Applied and Computational Topology, 9(4):30, Nov 2025

    work page 2025

  12. [12]

    Stability of 2-parameter persistent homology

    Andrew J Blumberg and Michael Lesnick. Stability of 2-parameter persistent homology. Foundations of Computational Mathematics, 24(2):385–427, 2024

    work page 2024

  13. [13]

    Cambridge University Press, 2018

    Jean-Daniel Boissonnat, Frédéric Chazal, and Mariette Yvinec.Geometric and topo- logical inference, volume 57. Cambridge University Press, 2018

    work page 2018

  14. [14]

    Incremental construc- tion of the Delaunay triangulation and the Delaunay graph in medium dimension

    Jean-Daniel Boissonnat, Olivier Devillers, and Samuel Hornus. Incremental construc- tion of the Delaunay triangulation and the Delaunay graph in medium dimension. In Proceedings of the twenty-fifth annual symposium on Computational geometry, pages 208–216, 2009

    work page 2009

  15. [15]

    Triangulations in CGAL

    Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, and Mariette Yvinec. Triangulations in CGAL. InProceedings of the sixteenth annual symposium on Com- putational geometry, pages 11–18, 2000

    work page 2000

  16. [16]

    The simplex tree: An efficient data structure for general simplicial complexes.Algorithmica, 70:406–427, 2014

    Jean-Daniel Boissonnat and Clément Maria. The simplex tree: An efficient data structure for general simplicial complexes.Algorithmica, 70:406–427, 2014

    work page 2014

  17. [17]

    An introduction to multiparameter persistence

    Magnus Botnan and Michael Lesnick. An introduction to multiparameter persistence. In Representations of Algebras and Related Structures: International Conference on Representations of Algebras, ICRA 2020, 9–25 November 2020, pages 77–150. EMS Press, 2023

    work page 2020

  18. [18]

    A. Bowyer. Computing Dirichlet tessellations.The Computer Journal, 24(2):162–166, February 1981

    work page 1981

  19. [19]

    Representability of algebraic topology for biomolecules in machine learning based scoring and virtual screening

    Zixuan Cang, Lin Mu, and Guo-Wei Wei. Representability of algebraic topology for biomolecules in machine learning based scoring and virtual screening. PLoS computational biology, 14(1):e1005929, 2018

    work page 2018

  20. [20]

    Persistent cohomology for data with multicomponent heterogeneous information.SIAM Journal on Mathematics of Data Science, 2(2):396– 418, 2020

    Zixuan Cang and Guo-Wei Wei. Persistent cohomology for data with multicomponent heterogeneous information.SIAM Journal on Mathematics of Data Science, 2(2):396– 418, 2020. BIFUNCTION AND INTERLEVEL DELAUNAY TRIFILTRATIONS 35

    work page 2020

  21. [21]

    The theory of multidimensional persistence

    Gunnar Carlsson and Afra Zomorodian. The theory of multidimensional persistence. Discrete & Computational Geometry, 42(1):71–93, 2009

    work page 2009

  22. [22]

    Cavanna, Mahmoodreza Jahanseir, and Donald R

    Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy. A geometric perspective on sparse filtrations. In Proceedings of the Canadian Conference on Computational Geometry, pages 116–121, 2015

    work page 2015

  23. [23]

    Scalar field analysis over point cloud data.Discrete & Computational Geometry, 46(4):743–775, 2011

    Frédéric Chazal, Leonidas J Guibas, Steve Y Oudot, and Primoz Skraba. Scalar field analysis over point cloud data.Discrete & Computational Geometry, 46(4):743–775, 2011

    work page 2011

  24. [24]

    Applications of random sampling in computa- tional geometry, II.Discrete Comput

    Kenneth L Clarkson and Peter W Shor. Applications of random sampling in computa- tional geometry, II.Discrete Comput. Geom., 4(5):387–421, October 1989

    work page 1989

  25. [25]

    Vines and vine- yards by updating persistence in linear time

    David Cohen-Steiner, Herbert Edelsbrunner, and Dmitriy Morozov. Vines and vine- yards by updating persistence in linear time. InProceedings of the twenty-second annual symposium on Computational geometry, pages 119–126, 2006

    work page 2006

  26. [26]

    Computing the multicover bifiltration.Discrete & Computational Geometry, 70(2):376–405, 2023

    René Corbet, Michael Kerber, Michael Lesnick, and Georg Osang. Computing the multicover bifiltration.Discrete & Computational Geometry, 70(2):376–405, 2023

    work page 2023

  27. [27]

    Separation, retractions and homotopy extension in semialgebraic spaces.Pacific Journal of Mathematics, 114(1):47–71, 1984

    Hans Delfs and Manfred Knebusch. Separation, retractions and homotopy extension in semialgebraic spaces.Pacific Journal of Mathematics, 114(1):47–71, 1984

    work page 1984

  28. [28]

    On deletion in Delaunay triangulations

    Olivier Devillers. On deletion in Delaunay triangulations. InProceedings of the fifteenth annual symposium on Computational geometry, page 181–188. ACM, June 1999

    work page 1999

  29. [29]

    Dey and Shreyas N

    Tamal K. Dey and Shreyas N. Samaga. Quasi zigzag persistence: A topological framework for analyzing time-varying data.arXiv, 2025. arXiv:2502.16049

    work page arXiv 2025

  30. [30]

    Chromatic alpha complexes.Foundations of Data Science, 8:30–62, 2026

    Sebastiano Cultrera di Montesano, Ondřej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. Chromatic alpha complexes.Foundations of Data Science, 8:30–62, 2026

    work page 2026

  31. [31]

    American Mathematical Society, 2022

    Herbert Edelsbrunner and John L Harer.Computational topology: an introduction. American Mathematical Society, 2022

    work page 2022

  32. [32]

    The medusa of spatial sorting: topological construction.arXiv, 2012

    Herbert Edelsbrunner, Carl-Philipp Heisenberg, Michael Kerber, and Gabriel Krens. The medusa of spatial sorting: topological construction.arXiv, 2012. arXiv:1207. 6474

    work page 2012

  33. [33]

    Herbert Edelsbrunner and Ernst P. Mücke. Three-dimensional alpha shapes.ACM Trans. Graph., 13(1):43–72, January 1994

    work page 1994

  34. [34]

    Herbert Edelsbrunner and Nimish R. Shah. Incremental topological flipping works for regular triangulations.Algorithmica, 15(3):223–241, 1996

    work page 1996

  35. [35]

    The smallest enclosing ball of balls: Combinato- rial structure and algorithms.International Journal of Computational Geometry & Applications, 14(04n05):341–378, 2004

    Kaspar Fischer and Bernd Gärtner. The smallest enclosing ball of balls: Combinato- rial structure and algorithms.International Journal of Computational Geometry & Applications, 14(04n05):341–378, 2004

    work page 2004

  36. [36]

    Bounding volumes

    Kaspar Fischer, Bernd Gärtner, Thomas Herrmann, Michael Hoffmann, and Sven Schönherr. Bounding volumes. InCGAL User and Reference Manual. CGAL Editorial Board, 5.6.1 edition, 2024.https://doc.cgal.org/5.6.1/Manual/packages.html# PkgBoundingVolumes

    work page 2024

  37. [37]

    Fast smallest-enclosing-ball compu- tation in high dimensions

    Kaspar Fischer, Bernd Gärtner, and Martin Kutz. Fast smallest-enclosing-ball compu- tation in high dimensions. In Giuseppe Di Battista and Uri Zwick, editors,Algorithms - ESA 2003, volume 2832, pages 630–641. Springer Berlin Heidelberg, 2003

    work page 2003

  38. [38]

    Detecting bifurcations in dynamical systems with crocker plots.Chaos: An Interdisciplinary Journal of Nonlinear Science, 32(9), 2022

    İsmail Güzel, Elizabeth Munch, and Firas A Khasawneh. Detecting bifurcations in dynamical systems with crocker plots.Chaos: An Interdisciplinary Journal of Nonlinear Science, 32(9), 2022

    work page 2022

  39. [39]

    Fast and robust smallest enclosing balls

    Bernd Gärtner. Fast and robust smallest enclosing balls. In Jaroslav Nešetřil, editor, Algorithms - ESA’ 99, volume 1643, pages 325–338. Springer Berlin Heidelberg, 1999

    work page 1999

  40. [40]

    3D kinetic alpha complexes and their im- plementation

    Michael Kerber and Herbert Edelsbrunner. 3D kinetic alpha complexes and their im- plementation. In2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 70–77. SIAM, 2013

    work page 2013

  41. [41]

    Benchmark data sets of minimal presentations of 2-parameter persistence modules.https://doi.org/10.3217/rxedk-qyq77, 2025

    Michael Kerber and Tung Lam. Benchmark data sets of minimal presentations of 2-parameter persistence modules.https://doi.org/10.3217/rxedk-qyq77, 2025. 36 A.J. ALONSO, M. KERBER, T. LAM, M. LESNICK, AND A. RATHOD

    work page doi:10.3217/rxedk-qyq77 2025

  42. [42]

    function_delaunay

    Michael Kerber and Tung Lam. function_delaunay. https://bitbucket.org/ mkerber/function_delaunay, 2025

    work page 2025

  43. [43]

    scc2020: A file format for sparse chain complexes in TDA, 2021.https://bitbucket.org/mkerber/chain_complex_format/ Accessed: 2024-12-04

    Michael Kerber and Michael Lesnick. scc2020: A file format for sparse chain complexes in TDA, 2021.https://bitbucket.org/mkerber/chain_complex_format/ Accessed: 2024-12-04

    work page 2021

  44. [44]

    Spatiotemporal persistent homology for dynamic metric spaces.Discrete & Computational Geometry, 66:831–875, 2021

    Woojin Kim and Facundo Mémoli. Spatiotemporal persistent homology for dynamic metric spaces.Discrete & Computational Geometry, 66:831–875, 2021

    work page 2021

  45. [45]

    Extracting persistent clusters in dynamic data via Möbius inversion.Discrete & Computational Geometry, 71(4):1276–1342, 2024

    Woojin Kim and Facundo Mémoli. Extracting persistent clusters in dynamic data via Möbius inversion.Discrete & Computational Geometry, 71(4):1276–1342, 2024

    work page 2024

  46. [46]

    Analysis of dynamic graphs and dynamic metric spaces via zigzag persistence

    Woojin Kim, Facundo Memoli, and Zane Smith. Analysis of dynamic graphs and dynamic metric spaces via zigzag persistence. InTopological Data Analysis: The Abel Symposium 2018, pages 371–389. Springer, 2020

    work page 2018

  47. [47]

    Nerve models of subdivision bifiltrations

    Michael Lesnick and Kenneth McCabe. Nerve models of subdivision bifiltrations. arXiv, 2024. arXiv:2406.07679

    work page arXiv 2024

  48. [48]

    Interactive Visualization of 2-D Persistence Modules

    Michael Lesnick and Matthew Wright. Interactive visualization of 2-D persistence modules. arXiv, 2015. arXiv:1512.00180

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  49. [49]

    Topological data analysis in time series: Temporal filtration and applica- tion to single-cell genomics.Algorithms, 15(10):371, October 2022

    Baihan Lin. Topological data analysis in time series: Temporal filtration and applica- tion to single-cell genomics.Algorithms, 15(10):371, October 2022

    work page 2022

  50. [50]

    Filtered complexes

    Clément Maria. Filtered complexes. InGUDHI User and Reference Manual. GUDHI Editorial Board, 3.10.0 edition, 2024.https://gudhi.inria.fr/doc/3.10.0/group_ _simplex__tree.html

    work page 2024

  51. [51]

    PhD thesis, Duke University, 2008

    Dmitriy Morozov.Homological illusions of persistence and stability. PhD thesis, Duke University, 2008

    work page 2008

  52. [52]

    PhD thesis, Duke University, 2013

    Elizabeth Munch.Applications of persistent homology to time varying systems. PhD thesis, Duke University, 2013

    work page 2013

  53. [53]

    Sliding windows and persistence: An application of topological methods to signal analysis.Foundations of computational mathematics, 15:799–838, 2015

    Jose A Perea and John Harer. Sliding windows and persistence: An application of topological methods to signal analysis.Foundations of computational mathematics, 15:799–838, 2015

    work page 2015

  54. [54]

    A coupled alpha complex.Journal of Computational Geometry, 14(1):221–256, October 2023

    Yohai Reani and Omer Bobrowski. A coupled alpha complex.Journal of Computational Geometry, 14(1):221–256, October 2023

    work page 2023

  55. [55]

    Stable and consistent density-based clustering via multiparameter persistence.Journal of Machine Learning Research, 25(258):1–74, 2024

    Alexander Rolle and Luis Scoccola. Stable and consistent density-based clustering via multiparameter persistence.Journal of Machine Learning Research, 25(258):1–74, 2024

    work page 2024

  56. [56]

    Alpha complex

    Vincent Rouvreau. Alpha complex. InGUDHI User and Reference Manual. GUDHI Editorial Board, 3.12.0 edition, 2026.https://gudhi.inria.fr/doc/3.12.0/group_ _alpha__complex.html

    work page 2026

  57. [57]

    PhD thesis, Columbia University, 2025

    Emily Lauren Saunders.Persistent Homology of Zig-Zag Families of Filtrations. PhD thesis, Columbia University, 2025

    work page 2025

  58. [58]

    Donald R. Sheehy. A sparse Delaunay filtration. In Kevin Buchin and Éric Colin de Verdière, editors,37th International Symposium on Computational Geometry (SoCG 2021), volume 189 ofLeibniz International Proceedings in Informatics (LIPIcs), pages 58:1–58:16, Dagstuhl, Germany, 2021. Schloss Dagstuhl – Leibniz-Zentrum für Infor- matik

    work page 2021

  59. [59]

    A topo- logical perspective on weather regimes.Climate Dynamics, 60(5):1415–1445, 2023

    Kristian Strommen, Matthew Chantry, Joshua Dorrington, and Nina Otter. A topo- logical perspective on weather regimes.Climate Dynamics, 60(5):1415–1445, 2023

    work page 2023

  60. [60]

    Using zigzag persistent homology to detect hopf bifurcations in dynamical systems.Algorithms, 13(11):278, 2020

    Sarah Tymochko, Elizabeth Munch, and Firas A Khasawneh. Using zigzag persistent homology to detect hopf bifurcations in dynamical systems.Algorithms, 13(11):278, 2020

    work page 2020

  61. [61]

    D. F. Watson. Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes.The Computer Journal, 24(2):167–172, February 1981

    work page 1981

  62. [62]

    Smallest enclosing disks (balls and ellipsoids)

    Emo Welzl. Smallest enclosing disks (balls and ellipsoids). In Hermann Maurer, editor, New Results and New Trends in Computer Science, volume 555, pages 359–370, Berlin/Heidelberg, 1991. Springer-Verlag. BIFUNCTION AND INTERLEVEL DELAUNAY TRIFILTRATIONS 37

    work page 1991

  63. [63]

    Capturing dynamics of time-varying data via topology.Foundations of Data Science, 4(1):1–36, 2022

    Lu Xian, Henry Adams, Chad M Topaz, and Lori Ziegelmeier. Capturing dynamics of time-varying data via topology.Foundations of Data Science, 4(1):1–36, 2022. CUNEF Universidad, Madrid, Spain and Institute of Geometry, Graz Uni- versity of Technology, Austria Email address: angel.alonso@cunef.edu Institute of Geometry, Graz University of Technology, Austria...

    work page 2022