Search arXiv⌕ Search

arXiv · 2609.31691

Holes in planar parallel sets: An integrated Betti-number bound and its pointwise failure

Abstract

Let A be a nonempty compact subset of the plane and let A (r) be its parallel set at distance r. We prove that the number of holes of A (r) the number of bounded components of its complement, which is its rst Betti number satises $\infty$ r 0 $β$1(A (r) ) dr $\le$ 4050 (diam A) 4 r -3 0 for every r0 > 0, the integrand vanishing for r $\ge$ diam A/ $\sqrt$ 3. The proof rests on Fu's theorem that the critical values of the distance function of a planar compact set form a set of vanishing half-dimensional Hausdor measure, on two lemmas of Rataj, Spodarev and Meschenmoser, and on a square-root summability estimate for the gaps of the critical-value set, of which we give a complete proof. We show by an explicit family of curves two combs facing each other that no analogous bound can hold at a xed radius: a connected curve of bounded length, diameter, oscillation count, parallel-set area and parallel-set perimeter can have arbitrarily many holes at one radius, so the integrated estimate cannot be replaced by a xed-radius bound in terms of these coarse geometric quantities. We also bound the hole count uniformly in the radius by the number of components of local maxima of the distance function, and record a bound on the boundary length of a parallel set by its area. The results supply the deterministic input for limit theorems on the persistent homology of the Wiener sausage.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tristan Guillaume. 2026-09-17. Holes in planar parallel sets: An integrated Betti-number bound and its pointwise failure. https://arxiv.org/abs/2609.31691

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Tiling 3D by Translates of a Single Polycube is Undecidable

We prove co-RE-completeness, and thus undecidability, of the following problem: given a single (connected) polycube, decide whether it tiles 3D Euclidean space by translations. We reduce from Wang tiling using the decorated two-prime Sudoku construction of Greenfeld and Tao and a cyclic encoding adapted from OpenAI's 3D aperiodic tile, and apply a reduction of Kim to make the prototile connected (via faces). Dimension three is optimal: translational monotiling is known to be decidable in $\mathbb{Z}^2$ and for a single (possibly disconnected) polyomino in $\mathbb{R}^2$.

cs.CG↗

Deterministic Distance Selection in $O(n^{4/3})$ Time

Let $P$ be a set of $n$ points in the plane. Given an integer $K$ with $1\le K\le {n\choose 2}$, the distance selection problem asks for the $K$-th smallest distance among all pairwise distances of the points of $P$. The problem has been studied extensively over the past four decades. Recently, Chan and Zheng (2023) gave a randomized algorithm with $O(n^{4/3})$ expected running time, while the best known deterministic algorithm runs in $O(n^{4/3}\log n)$ time. In this paper, we present a deterministic $O(n^{4/3})$-time algorithm for the problem, matching the best known randomized complexity. We also consider the more general bichromatic version of the problem, where two point sets $A$ and $B$ are given, with $m=|A|$ and $n=|B|$, and the goal is to find the $K$-th smallest distance among the $mn$ distances between points of $A$ and points of $B$. For this problem, the best previously known algorithm runs in $O((m\log n+n\log m+m^{2/3}n^{2/3})\log(m+n))$ time. We present a new deterministic algorithm with running time $O(m\log^2 n+n\log^2 m+m^{2/3}n^{2/3})$.

cs.CG↗

An open-source heuristic to reboot 2D nesting research

2D nesting problems rank among the most challenging cutting and packing problems. Yet, despite their practical relevance, research over the past decade has seen remarkably little progress. One reasonable explanation could be that nesting problems are already solved to near optimality, leaving little room for improvement. However, as our paper demonstrates, we are not at the limit after all. This paper presents $\texttt{sparrow}$, an open-source heuristic approach to solving 2D irregular strip packing problems, along with ten new real-world instances for benchmarking. Our approach decomposes the optimization problem into a sequence of feasibility problems, where collisions between items are gradually resolved. $\texttt{sparrow}$ consistently outperforms the state of the art - in some cases by an unexpectedly wide margin. We are therefore convinced that the aforementioned stagnation is better explained by both a high barrier to entry and a widespread lack of reproducibility. By releasing $\texttt{sparrow}$'s source code, we directly address both issues. At the same time, we are confident there remains significant room for further algorithmic improvement. The ultimate aim of this paper is not only to take a single step forward, but to reboot the research culture in the domain and enable continued, reproducible progress.

cs.CG↗