Lines avoiding balls in three dimensions revisited

DOI10.1007/s00454-012-9401-0zbMath1248.52004OpenAlexW1975573472MaRDI QIDQ443898

Natan Rubin

Publication date: 13 August 2012

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-012-9401-0

zbMATH Keywords

combinatorial complexityfree spacegeometric arrangementslines in spacetangents to spheresunion of simply-shaped bodies

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Cites Work

• On the union of cylinders in three dimensions
• Linear data structures for fast ray-shooting amidst convex polyhedra
• On lines missing polyhedral sets in 3-space
• Approximations and optimal geometric divide-and-conquer
• The overlay of lower envelopes and its applications
• Counting and representing intersections among triangles in three dimensions
• Lines avoiding unit balls in three dimensions
• Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
• Computing Envelopes in Four Dimensions with Applications
• The Partition Technique for Overlays of Envelopes
• Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
• On the complexity of sets of free lines and line segments among balls in three dimensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lines avoiding balls in three dimensions revisited