Abstract
We show that the union of n translates of a convex body in R3 can have Θ(n3) holes in the worst case, where a hole in a set X is a connected component of R3\ X. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions.
Original language | English (US) |
---|---|
Pages (from-to) | 104-124 |
Number of pages | 21 |
Journal | Discrete and Computational Geometry |
Volume | 57 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1 2017 |
Keywords
- Convex sets
- Motion planning
- Union complexity
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics