Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.24147

On Linear-Size Guillotine-Separable Subsets of Fat Convex Objects, Disks, and Squares

Mark de Berg·Debajyoti Kar·Arindam Khan·Rudrayan Kundu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $\mathcal{K}$ be a family of pairwise disjoint objects in the plane. We say that a subset $\mathcal{K}^*\subseteq \mathcal{K}$ is \emph{separable} if it admits a sequence of guillotine cuts that separate all objects in $\mathcal{K}^*$ from each other while not cutting any of them. Urrutia (1996) asked whether any family of $n$ convex objects has a separable subset of size $Ω(n)$. Pach and Tardos (2000) answered this question negatively for line segments, but established positive results for fat objects of similar size. More recently, it was shown that sets of arbitrarily-sized axis-aligned squares also admit a separable subset of linear size. However, the question whether any set of arbitrarily-sized fat convex objects has a separable subset of linear size has remained open, even for disks. A major obstacle is that the existing technique for arbitrarily-sized squares uses only axis-aligned cuts, while even for disks, axis-aligned cuts alone are insufficient to obtain a separable subset of linear size. We resolve this longstanding open problem by proving that every family of pairwise disjoint fat convex objects has a separable subset of linear size. Our result extends to higher dimensions: any family of pairwise disjoint arbitrarily-sized fat convex objects in $\mathbb{R}^d$, where $d$ is a fixed constant, has a subset of linear size that is recursively separable by a sequence of hyperplane cuts. Our framework also yields improved guarantees for important special cases. For axis-aligned squares with axis-aligned guillotine cuts, we leverage additional structural properties of squares to show that at least $13.46\%$ of the squares are separable, improving the previous best bound of $9/256 \approx 3.51\%$ due to Chalermsook, Kugelmann, Orgo, Uniyal, and Zarsav (2025). For disks, by exploiting Oler's packing inequality, we prove that at least $n/93$ disks can always be separated.

Explore related subjects

cs.CG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark de Berg, Debajyoti Kar, Arindam Khan, Rudrayan Kundu. 2026-08-04. On Linear-Size Guillotine-Separable Subsets of Fat Convex Objects, Disks, and Squares. https://arxiv.org/abs/2607.24147

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

KEEP EXPLORING

Related papers

arXiv2026

Homological Trimming and Regularity of Filtrations via Local Obstruction Modules

Existing link-based combinatorial preprocessing methods speed up the computation of persistent homology by removing a vertex or edge only when its link remains a cone. We replace this condition with a quantitative homological certificate. The reduced homology of the filtered link of a generator (a vertex or edge) defines a local obstruction module whose future part describes the effect of deleting that generator. Its barcode certifies either exact deletion or an explicit bound on the bottleneck error, and a conflict colouring extends this guarantee to families of generators. Our implementation, HomTrim, removes an additional 13% to 41% of the input edges beyond domination-only preprocessing and reduces backend persistence time by factors ranging from 1.55 to 4.61 on weighted flag filtrations. The same module also yields regularity diagrams that measure how far a generator can move before becoming visible to homology, together with a multiscale stability result.

cs.CG↗
arXiv2026

CuACD: A Fully GPU-Resident Approximate Convex Decomposition

Approximate convex decomposition (ACD) converts triangle meshes into small sets of convex parts and is a standard preprocessing step for physics simulation, collision detection, and large-scale robot learning. The majority of modern ACD methods produce high-quality decompositions through an expensive search over candidate cutting planes, with per-mesh runtimes of tens of seconds that force game pipelines into overnight bakes and keep articulated-object datasets on CPU clusters for days. Prior work has accelerated isolated stages, most recently VisACD's GPU-based visibility metric, yet the dominant costs -- search, mesh cutting, and convex hull construction -- have remained on the CPU because their natural decomposition into many small homogeneous phases trails off in a fading last wave at every kernel boundary, and the variable-sized output of each phase forces a host round trip simply to allocate the next launch's input. We address these obstacles by adopting the warp, rather than the thread or thread block, as the unit of algorithm design, an idea introduced in the graph-processing community for a different pathology and which we adapt here to fuse the many heterogeneous phases of a computational-geometry pipeline into single warp-resident kernels, paired with a device-side heap allocator that lets the buffers between fused phases be sized and allocated on the device. Building on this template, we present CuACD (CUDA ACD), the first fully GPU-resident ACD system, together with a suite of reusable GPU components, released as open-source standalone CUDA modules that drop into any search-based ACD pipeline. On the V-HACD benchmark, PartNet-Mobility, and an Objaverse subset, CuACD achieves more than an order of magnitude of speedup over CoACD at matched or better quality.

cs.CG↗
arXiv2026

Exact and Approximate Range Queries in Ball Mapper

Ball Mapper summarizes a finite metric dataset by covering the sample with closed balls centered at selected landmarks and connecting landmarks whose balls share observations. Its construction therefore depends critically on repeated fixed radius range queries, yet the effect of replacing exact queries by approximate search has not been systematically characterized. We formulate Ball Mapper through an abstract range query procedure that separates the mathematical construction from the search backend used to realize it. Under fixed ordering, exact procedures preserve the landmark sequence, cover, graph, and membership-based colorings. For approximate procedures, we derive deterministic bounds on covering radius and landmark separation under additive and multiplicative query errors, prove inclusions for the induced nerve, characterize edge survival through witness redundancy for conservative approximations, and bound perturbations of mean vertex colorings. The accompanying implementation provides independent exact reference backends together with exhaustive and approximate search methods under a common closed ball convention. Experiments on Gaussian, mixture, and noisy curve data across three seeds show that approximation fidelity depends strongly on geometry and that edges supported by multiple witnesses are substantially more robust to missed memberships. At 20,000 observations, the approximate indexes did not outperform exhaustive FAISS Flat search. The results therefore establish a framework for controlled approximation rather than a universal speed advantage, and identify the geometric and combinatorial quantities that govern when approximate range search preserves the Ball Mapper summary.

cs.CG↗