Abstract
Let B be a set of n unit balls in ℝ3. We show that the combinatorial complexity of the space of lines in ℝ3 that avoid all the balls of B is O(n3+ε), for any ε > 0. This result has connections to problems in visibility, ray shooting, motion planning, and geometric optimization.
Original language | English (US) |
---|---|
Pages (from-to) | 231-250 |
Number of pages | 20 |
Journal | Discrete and Computational Geometry |
Volume | 34 |
Issue number | 2 |
DOIs | |
State | Published - Aug 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics