Intersection properties of finite disk collections
Jesús F. Espinoza, Cynthia G. Esquer-Pérez
TL;DR
This work analyzes intersection properties of finite disk collections in $\\mathbb{R}^d$ and develops practical tools for generalized Čech complexes by leveraging pole-based tests and Helly-type reductions. It derives explicit center–radius formulas for the intersection sphere of two disks and extends to $m$ disks, providing a framework to compute poles and test nonempty intersections efficiently. The authors introduce algorithms for recognizing Čech systems and computing the Čech scale via bisection, and integrate a minimal axis-aligned bounding box (AABB) construction with a Helly-based reduction to handle higher-order disk intersections. The resulting methodologies enable robust, dimension-agnostic analysis of disk intersections, with applications to topology-driven data analysis and collision/spatial queries in higher dimensions.
Abstract
In this work we study the intersection properties of a finite disk system in the euclidean space. We accomplish this by utilizing subsets of spheres with varying dimensions and analyze specific points within them, referred to as poles. Additionally, we introduce two applications: estimating the common scale factor for the radii that makes the re-scaled disks intersects in a single point, this is the Čech scale, and constructing the minimal Axis-Aligned Bounding Box (AABB) that encloses the intersection of all disks in the system.
