Helly-type theorems for spheres
Discrete & Computational Geometry
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Discrete & Computational Geometry
Hi-index | 0.00 |
If each four spheres in a set of five unit spheres in R^3 have nonempty intersection, then all five spheres have nonempty intersection. This result is proved using Grace's theorem: the circumsphere of a tetrahedron encloses none of its escribed spheres. This paper provides self-contained proofs of these results; including Schlafli's double six theorem and modified version of Lie's line-sphere transformation. Some related problems are also posed.