On lines avoiding unit balls in three dimensions

13 years 9 months ago

Download graphics.stanford.edu

Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This result has connections to problems in visibility, ray shooting, motion planning and geometric optimization.

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M

Real-time Traffic

Combinatorial Complexity | COMPGEOM 2004 | Motion Planning | Unit Balls |

claim paper

» On the complexity of sets of free lines and line segments among balls in three dimensions

» SCALLOP A Highly Scalable Parallel Poisson Solver in Three Dimensions

» Adaptive sampling in three dimensions for volume rendering on GPUs

» Delaunay Refinement for Piecewise Smooth Complexes

» Symplectic Spreads and Permutation Polynomials

» Combinatorics and Geometry of Finite and Infinite Squaregraphs

» Stereo Reconstruction from Multiperspective Panoramas

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	COMPGEOM
Authors	Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir

Comments (0)

Sciweavers

On lines avoiding unit balls in three dimensions

Combinatorial Complexity | COMPGEOM 2004 | Motion Planning | Unit Balls |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers