English

Computing the Multicover Bifiltration

Computational Geometry 2022-04-15 v3 Algebraic Topology

Abstract

Given a finite set ARdA\subset\mathbb{R}^d, let Covr,k_{r,k} denote the set of all points within distance rr to at least kk points of AA. Allowing rr and kk to vary, we obtain a 2-parameter family of spaces that grow larger when rr increases or kk decreases, called the \emph{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 \v Cech-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.

Keywords

Cite

@article{arxiv.2103.07823,
  title  = {Computing the Multicover Bifiltration},
  author = {René Corbet and Michael Kerber and Michael Lesnick and Georg Osang},
  journal= {arXiv preprint arXiv:2103.07823},
  year   = {2022}
}

Comments

28 pages, 8 figures, 4 tables. Extended version of a paper accepted to the 2021 Symposium on Computational Geometry

R2 v1 2026-06-24T00:07:01.842Z