On lines avoiding unit balls in three dimensions

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Let B be a set of n unit balls in ℝ3. We show that the combinatorial complexity of the space of lines in ℝ3 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.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)
    Pages36-45
    Number of pages10
    Publication statusPublished - 2004
    EventProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04) - Brooklyn, NY, United States
    Duration: Jun 9 2004Jun 11 2004

    Other

    OtherProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)
    CountryUnited States
    CityBrooklyn, NY
    Period6/9/046/11/04

      Fingerprint

    Keywords

    • Combinatorial complexity
    • Lines in space
    • Visibility

    ASJC Scopus subject areas

    • Software
    • Geometry and Topology
    • Safety, Risk, Reliability and Quality
    • Chemical Health and Safety

    Cite this

    Agarwal, P. K., Aronov, B., Koltun, V., & Sharir, M. (2004). On lines avoiding unit balls in three dimensions. In Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04) (pp. 36-45)