Partitioning a Polygon Into Small Pieces

We study the problem of partitioning a given simple polygon P into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of ‘bounded size,’ namely that each piece must be contained in an axis-aligned or arbitrarily rotated unit square or a unit disk, or that each piece has bounded perimeter, straight-line diameter or geodesic diameter. The problems are motivated by practical settings in manufacturing, finite element analysis, collision detection, vehicle routing, shipping and laser capture microdissection.
The version where each piece should be contained in an axis-aligned unit square is already known to be NP- hard [Abrahamsen and Stade, FOCS, 2024], and the other versions seem no easier. Our main result is to develop constant-factor approximation algorithms, which means that the number of pieces in the produced partition is at most a constant factor larger than the cardinality of an optimal partition. Existing algorithms [Damian and Pemmaraju, Algorithmica, 2004] do not allow Steiner points, which means that all corners of the produced pieces must also be corners of P. This has the disappointing consequence that a partition often does not exist, whereas our algorithms always produce meaningful partitions. Furthermore, an optimal partition without Steiner points may require Ω(n ) pieces for polygons with n corners where a partition consisting of just 2 pieces exists when Steiner points are allowed. Other existing algorithms [Arkin, Das, Gao, Goswami, Mitchell, Polishchuk and Tóth, ESA, 2020] only allow P to be split along chords (and aim to minimize the number of chords instead of the number of pieces), whereas we make no constraints on the boundaries of the pieces.
In a related problem, we are given a polygon P and positive real values a1,…,ak whose sum equals the area of P. The goal is to partition P into exactly k pieces Q1,…, Qk such that the area of Qi is ai. Such a partition always exists, and an algorithm with running time O (nk) has previously been described [Bast and Hert, CCCG, 2000]. We improve on this result and give an algorithm with optimal running time O (n + k ) for simple polygons and a running time of O (n log n + k ) for polygons with holes.