נתן רובין

אקדמי בכיר

Lines avoiding balls in three dimensions revisited

Let ℬ be a collection of n arbitrary balls in ℝ3. We establish an almost-tight upper bound of O(n3+ε), for any ε > 0, on the complexity of the space ℱ(ℬ) of all the lines that avoid all the members of ℬ. In particular, we prove that the balls of ℬ admit O(n3+ε) free isolated tangents, for any ε > 0. This generalizes the result of Agarwal et al. [1], who established this bound only for congruent balls, and solves an open problem posed in that paper. Our bound almost meets the recent lower bound of Ω(n3) of Glisse and Lazard [6]. Our approach is constructive and yields an algorithm that computes a discrete representation of the boundary of ℱ(ℬ) in O(n3+ε) time, for any ε > 0.

שפת פרסום אנגלית
דפים 58-67
סטטוס פרסום פורסם - 30.07.2010

Keywords

Arrangements
Combinatorial complexity
Free lines
Lines in space
Tangency surfaces

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Mathematics
גישה למסמך
10.1145/1810959.1810970
קבצים וקישורים אחרים
Link to publication in Scopus