Computing the Multicover Bifiltration.

Saved in:
Bibliographic Details
Title: Computing the Multicover Bifiltration.
Authors: Corbet, René1 (AUTHOR) corbet@kth.se, Kerber, Michael2 (AUTHOR), Lesnick, Michael3 (AUTHOR), Osang, Georg4 (AUTHOR)
Source: Discrete & Computational Geometry. Sep2023, Vol. 70 Issue 2, p376-405. 30p.
Subjects: Point set theory, Polyhedral functions
Abstract: Given a finite set A ⊂ R d , let Cov r , k denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. [ABSTRACT FROM AUTHOR]
Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
Be the first to leave a comment!
You must be logged in first