Line transversals of balls and smallest enclosing cylinders in three dimensions

P. K. Agarwal, B. Aronov, M. Sharir

    Research output: Contribution to journalArticlepeer-review

    Abstract

    We establish a near-cubic upper bound on the complexity of the space of line transversals of a collection of n balls in three dimensions, and show that the bound is almost tight, in the worst case. We apply this bound to obtain a near-cubic algorithm for computing a smallest infinite cylinder enclosing a given set of points or balls in 3-space. We also present an approximation algorithm for computing a smallest enclosing cylinder.

    Original languageEnglish (US)
    Pages (from-to)373-388
    Number of pages16
    JournalDiscrete and Computational Geometry
    Volume21
    Issue number3
    DOIs
    StatePublished - Apr 1999

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Geometry and Topology
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics

    Fingerprint Dive into the research topics of 'Line transversals of balls and smallest enclosing cylinders in three dimensions'. Together they form a unique fingerprint.

    Cite this