Union of convex polyhedra in three dimensions

Boris Aronov, Micha Sharir

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

    Abstract

    We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k3+kn log2 k). This bound is almost tight in the worst case. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k3+kn log3 k) expected time.

    Original languageEnglish (US)
    Title of host publicationAnnual Symposium on Foundatons of Computer Science (Proceedings)
    Editors Anon
    PublisherPubl by IEEE
    Pages518-527
    Number of pages10
    ISBN (Print)0818643706
    StatePublished - 1993
    EventProceedings of the 34th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA
    Duration: Nov 3 1993Nov 5 1993

    Other

    OtherProceedings of the 34th Annual Symposium on Foundations of Computer Science
    CityPalo Alto, CA, USA
    Period11/3/9311/5/93

    ASJC Scopus subject areas

    • Hardware and Architecture

    Cite this

    Aronov, B., & Sharir, M. (1993). Union of convex polyhedra in three dimensions. In Anon (Ed.), Annual Symposium on Foundatons of Computer Science (Proceedings) (pp. 518-527). Publ by IEEE.

    Union of convex polyhedra in three dimensions. / Aronov, Boris; Sharir, Micha.

    Annual Symposium on Foundatons of Computer Science (Proceedings). ed. / Anon. Publ by IEEE, 1993. p. 518-527.

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

    Aronov, B & Sharir, M 1993, Union of convex polyhedra in three dimensions. in Anon (ed.), Annual Symposium on Foundatons of Computer Science (Proceedings). Publ by IEEE, pp. 518-527, Proceedings of the 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, USA, 11/3/93.
    Aronov B, Sharir M. Union of convex polyhedra in three dimensions. In Anon, editor, Annual Symposium on Foundatons of Computer Science (Proceedings). Publ by IEEE. 1993. p. 518-527
    Aronov, Boris ; Sharir, Micha. / Union of convex polyhedra in three dimensions. Annual Symposium on Foundatons of Computer Science (Proceedings). editor / Anon. Publ by IEEE, 1993. pp. 518-527
    @inproceedings{10b8ea1cf39c4ebe9b9e3c5801e63016,
    title = "Union of convex polyhedra in three dimensions",
    abstract = "We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k3+kn log2 k). This bound is almost tight in the worst case. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k3+kn log3 k) expected time.",
    author = "Boris Aronov and Micha Sharir",
    year = "1993",
    language = "English (US)",
    isbn = "0818643706",
    pages = "518--527",
    editor = "Anon",
    booktitle = "Annual Symposium on Foundatons of Computer Science (Proceedings)",
    publisher = "Publ by IEEE",

    }

    TY - GEN

    T1 - Union of convex polyhedra in three dimensions

    AU - Aronov, Boris

    AU - Sharir, Micha

    PY - 1993

    Y1 - 1993

    N2 - We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k3+kn log2 k). This bound is almost tight in the worst case. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k3+kn log3 k) expected time.

    AB - We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k3+kn log2 k). This bound is almost tight in the worst case. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k3+kn log3 k) expected time.

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

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

    M3 - Conference contribution

    AN - SCOPUS:0027842565

    SN - 0818643706

    SP - 518

    EP - 527

    BT - Annual Symposium on Foundatons of Computer Science (Proceedings)

    A2 - Anon, null

    PB - Publ by IEEE

    ER -