Document Open Access Logo

A Sparse Multicover Bifiltration of Linear Size

Author Ángel Javier Alonso

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.6.pdf
  • Filesize: 1.21 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Topology
  • Theory of computation → Computational geometry
Keywords
  • Multicover
  • Approximation
  • Sparsification
  • Multiparameter persistence

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The k-cover of a point cloud X of ℝ^d at radius r is the set of all those points within distance r of at least k points of X. By varying r and k we obtain a two-parameter filtration known as the multicover bifiltration. This bifiltration has received attention recently due to being choice-free and robust to outliers. However, it is hard to compute: the smallest known equivalent simplicial bifiltration has O(|X|^{d+1}) simplices. In this paper we introduce a (1+ε)-approximation of the multicover bifiltration of linear size O(|X|), for fixed d and ε. The methods also apply to the subdivision Rips bifiltration on metric spaces of bounded doubling dimension yielding analogous results.

Cite As Get BibTex

Ángel Javier Alonso. A Sparse Multicover Bifiltration of Linear Size. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.6

Author Details

Ángel Javier Alonso
  • Graz University of Technology, Austria

Funding

This research was funded in whole, or in part, by the Austrian Science Fund (FWF) 10.55776/P33765.

Acknowledgements

The author would like to thank his advisor Michael Kerber for helpful comments. He would also like to deeply thank an anonymous reviewer for many comments that helped to substantially improve the exposition. Part of the writing was carried out while the author was visiting Yasuaki Hiraoka’s group at the Kyoto University Institute of Advanced Study.

References

  1. Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, and Yuhei Umeda. DTM-Based Filtrations. In Gill Barequet and Yusu Wang, editors, 35th International Symposium on Computational Geometry, SoCG 2019, volume 129 of LIPIcs, pages 58:1-58:15, 2019. URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.58.
  2. Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, and Yuhei Umeda. DTM-Based Filtrations. In Nils A. Baas, Gunnar E. Carlsson, Gereon Quick, Markus Szymik, and Marius Thaule, editors, Topological Data Analysis, pages 33-66. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-43408-3_2.
  3. Dominique Attali, André Lieutier, and David Salinas. Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes. In Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, SoCG 2011, pages 491-500, June 2011. URL: https://doi.org/10.1145/1998196.1998276.
  4. Dominique Attali, André Lieutier, and David Salinas. Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes. Computational Geometry, 46(4):448-465, May 2013. URL: https://doi.org/10.1016/j.comgeo.2012.02.009.
  5. Andrew J. Blumberg, Itamar Gal, Michael A. Mandell, and Matthew Pancia. Robust Statistics, Hypothesis Testing, and Confidence Intervals for Persistent Homology on Metric Measure Spaces. Foundations of Computational Mathematics, 14:745-789, August 2014. URL: https://doi.org/10.1007/s10208-014-9201-4.
  6. Andrew J. Blumberg and Michael Lesnick. Universality of the homotopy interleaving distance. Transactions of the American Mathematical Society, 376:8269-8307, 2023. URL: https://doi.org/10.1090/tran/8738.
  7. Andrew J. Blumberg and Michael Lesnick. Stability of 2-Parameter Persistent Homology. Foundations of Computational Mathematics, 24:385-427, 2024. URL: https://doi.org/10.1007/s10208-022-09576-6.
  8. Omer Bobrowski, Sayan Mukherjee, and Jonathan E. Taylor. Topological consistency via kernel estimation. Bernoulli, 23(1):288-328, February 2017. URL: https://doi.org/10.3150/15-BEJ744.
  9. Mickaël Buchet, Bianca B. Dornelas, and Michael Kerber. Sparse Higher Order Čech Filtrations. In Erin W. Chambers and Joachim Gudmundsson, editors, 39th International Symposium on Computational Geometry, SoCG 2023, volume 258 of LIPIcs, pages 20:1-20:17, 2023. URL: https://doi.org/10.4230/LIPIcs.SoCG.2023.20.
  10. Mickaël Buchet, Frédéric Chazal, Steve Y. Oudot, and Donald R. Sheehy. Efficient and robust persistent homology for measures. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pages 168-180, January 2015. URL: https://doi.org/10.1137/1.9781611973730.13.
  11. Mickaël Buchet, Frédéric Chazal, Steve Y. Oudot, and Donald R. Sheehy. Efficient and robust persistent homology for measures. Computational Geometry, 58:70-96, October 2016. URL: https://doi.org/10.1016/j.comgeo.2016.07.001.
  12. Mickaël Buchet, Bianca B. Dornelas, and Michael Kerber. Sparse Higher Order Čech Filtrations. Journal of the ACM, 71(4):1-23, August 2024. URL: https://doi.org/10.1145/3666085.
  13. Gunnar Carlsson and Afra Zomorodian. The Theory of Multidimensional Persistence. Discrete & Computational Geometry, 42(1):71-93, July 2009. URL: https://doi.org/10.1007/s00454-009-9176-0.
  14. Nicholas J. Cavanna, Kirk P. Gardner, and Donald R. Sheehy. When and Why the Topological Coverage Criterion Works. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pages 2679-2690, January 2017. URL: https://doi.org/10.1137/1.9781611974782.177.
  15. Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy. Visualizing Sparse Filtrations. In Lars Arge and János Pach, editors, 31st International Symposium on Computational Geometry, SoCG 2015, volume 34, pages 23-25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. URL: https://doi.org/10.4230/LIPICS.SOCG.2015.23.
  16. Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy. A Geometric Perspective on Sparse Filtrations. In Proceedings of the 27th Canadian Conference on Computational Geometry, pages 116-121, 2015. URL: https://arxiv.org/abs/1506.03797.
  17. Mark E. Cawood and P. M. Dearing. The weighted Euclidean one-center problem in Rⁿ. Computational Optimization and Applications, August 2024. URL: https://doi.org/10.1007/s10589-024-00599-z.
  18. Frédéric Chazal, David Cohen-Steiner, and Quentin Mérigot. Geometric Inference for Probability Measures. Foundations of Computational Mathematics, 11(6):733-751, December 2011. URL: https://doi.org/10.1007/s10208-011-9098-0.
  19. Frédéric Chazal, Brittany Fasy, Fabrizio Lecci, Bertrand Michel, Alessandro Rinaldo, and Larry Wasserman. Robust topological inference: Distance to a measure and kernel distance. J. Mach. Learn. Res., 18(1):5845-5884, January 2017. Google Scholar
  20. Frédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, and Primoz Skraba. Persistence-Based Clustering in Riemannian Manifolds. Journal of the ACM, 60(6):1-38, November 2013. URL: https://doi.org/10.1145/2535927.
  21. Oliver Chubet, Don Sheehy, and Siddharth Sheth. Simple Construction of Greedy Trees and Greedy Permutations, December 2024. URL: https://doi.org/10.48550/arXiv.2412.02554.
  22. Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, and Siddharth Sheth. Proximity Search in the Greedy Tree. In 2023 Symposium on Simplicity in Algorithms (SOSA), January 2023. URL: https://doi.org/10.1137/1.9781611977585.
  23. Kenneth L. Clarkson. Fast algorithms for the all nearest neighbors problem. In 24th Annual Symposium on Foundations of Computer Science, pages 226-232, November 1983. URL: https://doi.org/10.1109/SFCS.1983.16.
  24. Kenneth L. Clarkson. Nearest neighbor searching in metric spaces: Experimental results for sb(S), 2003. URL: https://kenclarkson.org/Msb/white_paper.pdf.
  25. David Cohen-Steiner, Herbert Edelsbrunner, and John Harer. Stability of persistence diagrams. In Proceedings of the Twenty-First Annual Symposium on Computational Geometry, SoCG 2005, SoCG '05, pages 263-271, June 2005. URL: https://doi.org/10.1145/1064092.1064133.
  26. David Cohen-Steiner, Herbert Edelsbrunner, and John Harer. Stability of Persistence Diagrams. Discrete & Computational Geometry, 37(1):103-120, January 2007. URL: https://doi.org/10.1007/s00454-006-1276-5.
  27. René Corbet, Michael Kerber, Michael Lesnick, and Georg Osang. Computing the multicover bifiltration. In Kevin Buchin and Éric Colin de Verdière, editors, 37th International Symposium on Computational Geometry, SoCG 2021, volume 189 of LIPIcs, pages 27:1-27:17, 2021. URL: https://doi.org/10.4230/LIPIcs.SoCG.2021.27.
  28. René Corbet, Michael Kerber, Michael Lesnick, and Georg Osang. Computing the Multicover Bifiltration. Discrete & Computational Geometry, 70(2):376-405, September 2023. URL: https://doi.org/10.1007/s00454-022-00476-8.
  29. P. M. Dearing and Mark E. Cawood. The minimum covering Euclidean ball of a set of Euclidean balls in Rⁿ. Annals of Operations Research, 322(2):631-659, March 2023. URL: https://doi.org/10.1007/s10479-022-05138-9.
  30. M.E Dyer and A.M Frieze. A simple heuristic for the p-centre problem. Operations Research Letters, 3(6):285-288, February 1985. URL: https://doi.org/10.1016/0167-6377(85)90002-1.
  31. Herbert Edelsbrunner. The union of balls and its dual shape. Discrete & Computational Geometry, 13:415-440, 1995. URL: https://doi.org/10.1007/BF02574053.
  32. Herbert Edelsbrunner and J. Harer. Computational Topology: An Introduction. American Mathematical Society, Providence, R.I, 2010. Google Scholar
  33. Herbert Edelsbrunner and Georg Osang. The Multi-cover Persistence of Euclidean Balls. In 34th International Symposium on Computational Geometry, SoCG 2018, LIPIcs, page 14 pages, 2018. URL: https://doi.org/10.4230/LIPICS.SOCG.2018.34.
  34. Herbert Edelsbrunner and Georg Osang. The Multi-Cover Persistence of Euclidean Balls. Discrete & Computational Geometry, 65(4):1296-1313, June 2021. URL: https://doi.org/10.1007/s00454-021-00281-9.
  35. Kaspar Fischer and Bernd Gärtner. The smallest enclosing ball of balls: Combinatorial structure and algorithms. International Journal of Computational Geometry & Applications, 14(04n05):341-378, October 2004. URL: https://doi.org/10.1142/S0218195904001500.
  36. Kaspar Fischer, Bernd Gärtner, Thomas Herrmann, Michael Hoffmann, and Sven Schönherr. Bounding volumes. In CGAL User and Reference Manual. CGAL Editorial Board, 5.6.1 edition, 2024. URL: https://doc.cgal.org/5.6.1/Manual/packages.html#PkgBoundingVolumes.
  37. Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985. URL: https://doi.org/10.1016/0304-3975(85)90224-5.
  38. Leonidas Guibas, Dmitriy Morozov, and Quentin Mérigot. Witnessed k-Distance. Discrete & Computational Geometry, 49(1):22-45, January 2013. URL: https://doi.org/10.1007/s00454-012-9465-x.
  39. Leonidas J. Guibas, Quentin Mérigot, and Dmitriy Morozov. Witnessed k-distance. In Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, SoCG 2011, pages 57-64, June 2011. URL: https://doi.org/10.1145/1998196.1998205.
  40. Sariel Har-Peled and Manor Mendel. Fast Construction of Nets in Low Dimensional Metrics, and Their Applications. SIAM Journal on Computing, 35(5):1148-1184, January 2006. URL: https://doi.org/10.1137/S0097539704446281.
  41. Niklas Hellmer and Jan Spaliński. Density Sensitive Bifiltered Dowker Complexes via Total Weight, September 2024. URL: https://arxiv.org/abs/2405.15592.
  42. Michael Lesnick and Ken McCabe. Nerve Models of Subdivision Bifiltrations, June 2024. URL: https://doi.org/10.48550/arXiv.2406.07679.
  43. Michael Lesnick and Kenneth McCabe. Sparse Approximation of the Subdivision-Rips Bifiltration for Doubling Metrics, August 2024. URL: https://doi.org/10.48550/arXiv.2408.16716.
  44. Michael Lesnick and Matthew Wright. Interactive Visualization of 2-D Persistence Modules, December 2015. URL: https://arxiv.org/abs/1512.00180.
  45. Jiří Matoušek, Micha Sharir, and Emo Welzl. A Subexponential Bound for Linear Programming. Algorithmica, 16:498-516, 1996. URL: https://doi.org/10.1007/BF01940877.
  46. Partha Niyogi, Stephen Smale, and Shmuel Weinberger. Finding the Homology of Submanifolds with High Confidence from Random Samples. Discrete & Computational Geometry, 39(1-3):419-441, March 2008. URL: https://doi.org/10.1007/s00454-008-9053-2.
  47. Jeff M. Phillips, Bei Wang, and Yan Zheng. Geometric Inference on Kernel Density Estimates. In 31st International Symposium on Computational Geometry, SoCG 2015, volume 34, pages 857-871. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. URL: https://doi.org/10.4230/LIPICS.SOCG.2015.857.
  48. Alexander Rolle and Luis Scoccola. Stable and Consistent Density-Based Clustering via Multiparameter Persistence. Journal of Machine Learning Research, 25(258):1-74, 2024. URL: http://jmlr.org/papers/v25/21-1185.html.
  49. Daniel J. Rosenkrantz, Richard E. Stearns, and Philip M. Lewis. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6(3):563-581, 1977. URL: https://doi.org/10.1137/0206041.
  50. Luis Scoccola and Alexander Rolle. Persistable: Persistent and stable clustering. Journal of Open Source Software, 8(83):5022, March 2023. URL: https://doi.org/10.21105/joss.05022.
  51. Donald R. Sheehy. Greedypermutations. URL: https://github.com/donsheehy/greedypermutation.
  52. Donald R. Sheehy. Linear-size approximations to the Vietoris-Rips filtration. In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry, SoCG 2012, pages 239-248, June 2012. URL: https://doi.org/10.1145/2261250.2261286.
  53. Donald R. Sheehy. A Multicover Nerve for Geometric Inference. In Proceedings of the 24th Canadian Conference on Computational Geometry, page 5, 2012. URL: https://donsheehy.net/research/sheehy12multicover.pdf.
  54. Donald R. Sheehy. Linear-Size Approximations to the Vietoris-Rips Filtration. Discrete & Computational Geometry, 49(4):778-796, June 2013. URL: https://doi.org/10.1007/s00454-013-9513-1.
  55. Donald R. Sheehy. A Sparse Delaunay Filtration. In 37th International Symposium on Computational Geometry, SoCG 2021, volume 189, pages 58:1-58:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.SOCG.2021.58.
  56. J. J. Sylvester. A question on the geometry of situation. Quarterly Journal of Pure and Applied Mathematics, 1:79, 1857. URL: http://resolver.sub.uni-goettingen.de/purl?PPN600494829_0001.
  57. 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. URL: https://doi.org/10.1007/BFb0038202.
  58. Samuel Zürcher. Smallest Enclosing Ball for a Point Set with Strictly Convex Level Sets. Master’s thesis, ETH Zurich, Institute of Theoretical Computer Science, 2007. URL: https://samzurcher.ch/assets/pdf/master-thesis.pdf.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact