Efficient algorithms for bichromatic separability

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun

    Research output: Contribution to journalArticle

    Abstract

    A closed solid body separates one point set from another if it contains the former and the closure of its complement contains the latter. We present a near-linear algorithm for deciding whether two sets of n points in ℝ 3 can be separated by a prism, near-quadratic algorithms for separating by a slab or a wedge, and a near-cubic algorithm for separating by a double wedge. The latter three algorithms improve the previous best known results by an order of magnitude, while the prism separability algorithm constitutes an improvement of two orders of magnitude.

    Original languageEnglish (US)
    Pages (from-to)209-227
    Number of pages19
    JournalACM Transactions on Algorithms
    Volume2
    Issue number2
    DOIs
    StatePublished - 2006

    Fingerprint

    Separability
    Efficient Algorithms
    Prism
    Wedge
    Linear Algorithm
    Point Sets
    Closure
    Complement
    Closed

    Keywords

    • Arrangements
    • Geometric algorithms
    • Separability

    ASJC Scopus subject areas

    • Mathematics (miscellaneous)

    Cite this

    Efficient algorithms for bichromatic separability. / Agarwal, Pankaj K.; Aronov, Boris; Koltun, Vladlen.

    In: ACM Transactions on Algorithms, Vol. 2, No. 2, 2006, p. 209-227.

    Research output: Contribution to journalArticle

    Agarwal, Pankaj K. ; Aronov, Boris ; Koltun, Vladlen. / Efficient algorithms for bichromatic separability. In: ACM Transactions on Algorithms. 2006 ; Vol. 2, No. 2. pp. 209-227.
    @article{695940c6ed3149789ffaee9fe30e07dd,
    title = "Efficient algorithms for bichromatic separability",
    abstract = "A closed solid body separates one point set from another if it contains the former and the closure of its complement contains the latter. We present a near-linear algorithm for deciding whether two sets of n points in ℝ 3 can be separated by a prism, near-quadratic algorithms for separating by a slab or a wedge, and a near-cubic algorithm for separating by a double wedge. The latter three algorithms improve the previous best known results by an order of magnitude, while the prism separability algorithm constitutes an improvement of two orders of magnitude.",
    keywords = "Arrangements, Geometric algorithms, Separability",
    author = "Agarwal, {Pankaj K.} and Boris Aronov and Vladlen Koltun",
    year = "2006",
    doi = "10.1145/1150334.1150338",
    language = "English (US)",
    volume = "2",
    pages = "209--227",
    journal = "ACM Transactions on Algorithms",
    issn = "1549-6325",
    publisher = "Association for Computing Machinery (ACM)",
    number = "2",

    }

    TY - JOUR

    T1 - Efficient algorithms for bichromatic separability

    AU - Agarwal, Pankaj K.

    AU - Aronov, Boris

    AU - Koltun, Vladlen

    PY - 2006

    Y1 - 2006

    N2 - A closed solid body separates one point set from another if it contains the former and the closure of its complement contains the latter. We present a near-linear algorithm for deciding whether two sets of n points in ℝ 3 can be separated by a prism, near-quadratic algorithms for separating by a slab or a wedge, and a near-cubic algorithm for separating by a double wedge. The latter three algorithms improve the previous best known results by an order of magnitude, while the prism separability algorithm constitutes an improvement of two orders of magnitude.

    AB - A closed solid body separates one point set from another if it contains the former and the closure of its complement contains the latter. We present a near-linear algorithm for deciding whether two sets of n points in ℝ 3 can be separated by a prism, near-quadratic algorithms for separating by a slab or a wedge, and a near-cubic algorithm for separating by a double wedge. The latter three algorithms improve the previous best known results by an order of magnitude, while the prism separability algorithm constitutes an improvement of two orders of magnitude.

    KW - Arrangements

    KW - Geometric algorithms

    KW - Separability

    UR - http://www.scopus.com/inward/record.url?scp=33747708183&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33747708183&partnerID=8YFLogxK

    U2 - 10.1145/1150334.1150338

    DO - 10.1145/1150334.1150338

    M3 - Article

    VL - 2

    SP - 209

    EP - 227

    JO - ACM Transactions on Algorithms

    JF - ACM Transactions on Algorithms

    SN - 1549-6325

    IS - 2

    ER -