נתן רובין

אקדמי בכיר

Lines avoiding balls in three dimensions revisited

Let B be a collection of n arbitrary balls in ℝ 3. We establish an almost-tight upper bound of O(n 3+ε), for any ε>0, on the complexity of the space F(B) of all the lines that avoid all the members of B. In particular, we prove that the balls of B admit O(n 3+ε) free isolated tangents, for any ε>0. This generalizes the result of Agarwal et al. (Discrete Comput. Geom. 34:231-250, 2005), 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 Ω(n 3) of Glisse and Lazard (Proc. 26th Annu. Symp. Comput. Geom., pp. 48-57, 2010). Our approach is constructive and yields an algorithm that computes the discrete representation of the boundary of F(B) in O(n 3+ε) time, for any ε>0.

שפת פרסום אנגלית
דפים 65-93
כתב עת Discrete and Computational Geometry
כרך 48
נושא מספר 1
סטטוס פרסום פורסם - 01.07.2012

Keywords

Combinatorial complexity
Free space
Geometric arrangements
Lines in space
Tangents to spheres
Union of simply-shaped bodies

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
גישה למסמך
10.1007/s00454-012-9401-0
קבצים וקישורים אחרים
Link to publication in Scopus