Star unfolding of a polytope with applications

Pankaj K. Agarwal, Boris Aronov, Joseph O’Rourke, Catherine A. Schevon

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

    Abstract

    We define the notion of a “star unfolding” of the surface P of a convex polytope with n vertices and use it to construct an algorithm for computing a small superset of the set of all sequences of edges traversed by shortest paths on P. It requires O(n6) time and produces O(n8) sequences, thereby improving an earlier algorithm of Sharir that in O(n8 log n) time produces O(n7) sequences, A variant of our algorithm runs in O(n5 log n) time and produces a more compact representation of size O(n5) for the same set of O(n6) sequences. In addition, we describe an O(n10) time procedure for computing the geodesic diameter of P, which is the maximum possible separation of two points on P, with the distance measured along P, improving an earlier O(n14 log n) algorithm of O’Rourke and Schevon.

    Original languageEnglish (US)
    Title of host publicationSWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings
    PublisherSpringer Verlag
    Pages251-263
    Number of pages13
    Volume447 LNCS
    ISBN (Print)9783540528463
    DOIs
    StatePublished - 1990
    Event2nd Scandinavian Workshop on Algorithm Theory, SWAT 1990 - Bergen, Norway
    Duration: Jul 11 1990Jul 14 1990

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume447 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other2nd Scandinavian Workshop on Algorithm Theory, SWAT 1990
    CountryNorway
    CityBergen
    Period7/11/907/14/90

    Fingerprint

    Unfolding
    Polytope
    Stars
    Star
    Convex Polytope
    Computing
    Shortest path
    Geodesic

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Agarwal, P. K., Aronov, B., O’Rourke, J., & Schevon, C. A. (1990). Star unfolding of a polytope with applications. In SWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings (Vol. 447 LNCS, pp. 251-263). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 447 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-52846-6_94

    Star unfolding of a polytope with applications. / Agarwal, Pankaj K.; Aronov, Boris; O’Rourke, Joseph; Schevon, Catherine A.

    SWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. Vol. 447 LNCS Springer Verlag, 1990. p. 251-263 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 447 LNCS).

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

    Agarwal, PK, Aronov, B, O’Rourke, J & Schevon, CA 1990, Star unfolding of a polytope with applications. in SWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. vol. 447 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 447 LNCS, Springer Verlag, pp. 251-263, 2nd Scandinavian Workshop on Algorithm Theory, SWAT 1990, Bergen, Norway, 7/11/90. https://doi.org/10.1007/3-540-52846-6_94
    Agarwal PK, Aronov B, O’Rourke J, Schevon CA. Star unfolding of a polytope with applications. In SWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. Vol. 447 LNCS. Springer Verlag. 1990. p. 251-263. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-52846-6_94
    Agarwal, Pankaj K. ; Aronov, Boris ; O’Rourke, Joseph ; Schevon, Catherine A. / Star unfolding of a polytope with applications. SWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. Vol. 447 LNCS Springer Verlag, 1990. pp. 251-263 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{e7ddc572b5e548f0a35226922a69640d,
    title = "Star unfolding of a polytope with applications",
    abstract = "We define the notion of a “star unfolding” of the surface P of a convex polytope with n vertices and use it to construct an algorithm for computing a small superset of the set of all sequences of edges traversed by shortest paths on P. It requires O(n6) time and produces O(n8) sequences, thereby improving an earlier algorithm of Sharir that in O(n8 log n) time produces O(n7) sequences, A variant of our algorithm runs in O(n5 log n) time and produces a more compact representation of size O(n5) for the same set of O(n6) sequences. In addition, we describe an O(n10) time procedure for computing the geodesic diameter of P, which is the maximum possible separation of two points on P, with the distance measured along P, improving an earlier O(n14 log n) algorithm of O’Rourke and Schevon.",
    author = "Agarwal, {Pankaj K.} and Boris Aronov and Joseph O’Rourke and Schevon, {Catherine A.}",
    year = "1990",
    doi = "10.1007/3-540-52846-6_94",
    language = "English (US)",
    isbn = "9783540528463",
    volume = "447 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "251--263",
    booktitle = "SWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings",
    address = "Germany",

    }

    TY - GEN

    T1 - Star unfolding of a polytope with applications

    AU - Agarwal, Pankaj K.

    AU - Aronov, Boris

    AU - O’Rourke, Joseph

    AU - Schevon, Catherine A.

    PY - 1990

    Y1 - 1990

    N2 - We define the notion of a “star unfolding” of the surface P of a convex polytope with n vertices and use it to construct an algorithm for computing a small superset of the set of all sequences of edges traversed by shortest paths on P. It requires O(n6) time and produces O(n8) sequences, thereby improving an earlier algorithm of Sharir that in O(n8 log n) time produces O(n7) sequences, A variant of our algorithm runs in O(n5 log n) time and produces a more compact representation of size O(n5) for the same set of O(n6) sequences. In addition, we describe an O(n10) time procedure for computing the geodesic diameter of P, which is the maximum possible separation of two points on P, with the distance measured along P, improving an earlier O(n14 log n) algorithm of O’Rourke and Schevon.

    AB - We define the notion of a “star unfolding” of the surface P of a convex polytope with n vertices and use it to construct an algorithm for computing a small superset of the set of all sequences of edges traversed by shortest paths on P. It requires O(n6) time and produces O(n8) sequences, thereby improving an earlier algorithm of Sharir that in O(n8 log n) time produces O(n7) sequences, A variant of our algorithm runs in O(n5 log n) time and produces a more compact representation of size O(n5) for the same set of O(n6) sequences. In addition, we describe an O(n10) time procedure for computing the geodesic diameter of P, which is the maximum possible separation of two points on P, with the distance measured along P, improving an earlier O(n14 log n) algorithm of O’Rourke and Schevon.

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

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

    U2 - 10.1007/3-540-52846-6_94

    DO - 10.1007/3-540-52846-6_94

    M3 - Conference contribution

    AN - SCOPUS:85031907378

    SN - 9783540528463

    VL - 447 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 251

    EP - 263

    BT - SWAT 1990 - 2nd Scandinavian Workshop on Algorithm Theory, Proceedings

    PB - Springer Verlag

    ER -