# Line transversals to disjoint balls

2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We prove that the set of directions of lines intersecting three disjoint balls in $\mathbb{R}^3$ in a given order is a strictly convex subset of $\mathbb{S}^2$. We then generalize this result to $n$ disjoint balls in $\mathbb{R}^d$. As a consequence, we can improve upon several old and new results on line transversals to disjoint balls in arbitrary dimension, such as bounds on the number of connected components and Helly-type theorems.
Keywords :
Document type :
Conference papers

Cited literature [17 references]

https://hal.inria.fr/inria-00176201
Contributor : Xavier Goaoc <>
Submitted on : Tuesday, October 2, 2007 - 6:46:25 PM
Last modification on : Thursday, January 11, 2018 - 6:20:14 AM
Long-term archiving on: Thursday, September 27, 2012 - 12:32:24 PM

### File

Cone-socg07.pdf
Files produced by the author(s)

### Citation

Ciprian Borcea, Xavier Goaoc, Sylvain Petitjean. Line transversals to disjoint balls. 23rd Annual ACM Symposium on Computational Geometry 2007 - SoCG'07, 2007, Gyeongju, South Korea. pp.245-254, ⟨10.1145/1247069.1247115⟩. ⟨inria-00176201⟩

Record views