No-Dimensional Tverberg Partitions Revisited

Given a set P ⊂ R^d of n points, with diameter ∆, and a parameter δ ∈ (0, 1), it is known that there is a partition of P into sets P1, . . ., Pt, each of size O(1/δ²), such that their convex hulls all intersect a common ball of radius δ∆. We prove that a random partition, with a simple alteration step, yields the desired partition, resulting in a (randomized) linear time algorithm (i.e., O(dn)). We also provide a deterministic algorithm with running time O(dn log n). Previous proofs were either existential (i.e., at least exponential time), or required much bigger sets. In addition, the algorithm and its proof of correctness are significantly simpler than previous work, and the constants are slightly better. We also include a number of applications and extensions using the same central ideas. For example, we provide a linear time algorithm for computing a “fuzzy” centerpoint, and prove a no-dimensional weak ε-net theorem with an improved constant.