Nonoverlap of the star unfolding

Boris Aronov, Joseph O'Rourke

    Research output: Contribution to journalArticle

    Abstract

    The star unfolding of a convex polytope with respect to a point x on its surface is obtained by cutting the surface along the shortest paths from x to every vertex, and flattening the surface on the plane. We establish two main properties of the star unfolding: 1. It does not self-overlap: it is a simple polygon. 2. The ridge tree in the unfolding, which is the locus of points with more than one shortest path from x, is precisely the Voronoi diagram of the images of x, restricted to the unfolding. These two properties permit conceptual simplification of several algorithms concerned with shortest paths on polytopes, and sometimes a worst-case complexity improvement as well: • The construction of the ridge tree (in preparation for shortest-path queries, for instance) can be achieved by an especially simple O(n2) algorithm. This is no worst-case complexity improvement, but a considerable simplification nonetheless. • The exact set of all shortest-path "edge sequences" on a polytope can be found by an algorithm considerably simpler than was known previously, with a time improvement of roughly a factor of n over the old bound of O(n7 log n). • The geodesic diameter of a polygon can be found in O(n9 log n) time, an improvement of the previous best O(n10) algorithm. Our results suggest conjectures on "unfoldings" of general convex surfaces.

    Original languageEnglish (US)
    Pages (from-to)219-250
    Number of pages32
    JournalDiscrete and Computational Geometry
    Volume8
    Issue number1
    DOIs
    StatePublished - Dec 1992

    Fingerprint

    Unfolding
    Shortest path
    Stars
    Star
    Ridge
    Simplification
    Convex Surface
    Convex Polytope
    Simple Polygon
    Voronoi Diagram
    Polytopes
    Polytope
    Polygon
    Geodesic
    Locus
    Overlap
    Preparation
    Query
    Vertex of a graph

    ASJC Scopus subject areas

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

    Cite this

    Nonoverlap of the star unfolding. / Aronov, Boris; O'Rourke, Joseph.

    In: Discrete and Computational Geometry, Vol. 8, No. 1, 12.1992, p. 219-250.

    Research output: Contribution to journalArticle

    Aronov, Boris ; O'Rourke, Joseph. / Nonoverlap of the star unfolding. In: Discrete and Computational Geometry. 1992 ; Vol. 8, No. 1. pp. 219-250.
    @article{cc50d69f8b1249ed8efe4d6b9e3c1b7e,
    title = "Nonoverlap of the star unfolding",
    abstract = "The star unfolding of a convex polytope with respect to a point x on its surface is obtained by cutting the surface along the shortest paths from x to every vertex, and flattening the surface on the plane. We establish two main properties of the star unfolding: 1. It does not self-overlap: it is a simple polygon. 2. The ridge tree in the unfolding, which is the locus of points with more than one shortest path from x, is precisely the Voronoi diagram of the images of x, restricted to the unfolding. These two properties permit conceptual simplification of several algorithms concerned with shortest paths on polytopes, and sometimes a worst-case complexity improvement as well: • The construction of the ridge tree (in preparation for shortest-path queries, for instance) can be achieved by an especially simple O(n2) algorithm. This is no worst-case complexity improvement, but a considerable simplification nonetheless. • The exact set of all shortest-path {"}edge sequences{"} on a polytope can be found by an algorithm considerably simpler than was known previously, with a time improvement of roughly a factor of n over the old bound of O(n7 log n). • The geodesic diameter of a polygon can be found in O(n9 log n) time, an improvement of the previous best O(n10) algorithm. Our results suggest conjectures on {"}unfoldings{"} of general convex surfaces.",
    author = "Boris Aronov and Joseph O'Rourke",
    year = "1992",
    month = "12",
    doi = "10.1007/BF02293047",
    language = "English (US)",
    volume = "8",
    pages = "219--250",
    journal = "Discrete and Computational Geometry",
    issn = "0179-5376",
    publisher = "Springer New York",
    number = "1",

    }

    TY - JOUR

    T1 - Nonoverlap of the star unfolding

    AU - Aronov, Boris

    AU - O'Rourke, Joseph

    PY - 1992/12

    Y1 - 1992/12

    N2 - The star unfolding of a convex polytope with respect to a point x on its surface is obtained by cutting the surface along the shortest paths from x to every vertex, and flattening the surface on the plane. We establish two main properties of the star unfolding: 1. It does not self-overlap: it is a simple polygon. 2. The ridge tree in the unfolding, which is the locus of points with more than one shortest path from x, is precisely the Voronoi diagram of the images of x, restricted to the unfolding. These two properties permit conceptual simplification of several algorithms concerned with shortest paths on polytopes, and sometimes a worst-case complexity improvement as well: • The construction of the ridge tree (in preparation for shortest-path queries, for instance) can be achieved by an especially simple O(n2) algorithm. This is no worst-case complexity improvement, but a considerable simplification nonetheless. • The exact set of all shortest-path "edge sequences" on a polytope can be found by an algorithm considerably simpler than was known previously, with a time improvement of roughly a factor of n over the old bound of O(n7 log n). • The geodesic diameter of a polygon can be found in O(n9 log n) time, an improvement of the previous best O(n10) algorithm. Our results suggest conjectures on "unfoldings" of general convex surfaces.

    AB - The star unfolding of a convex polytope with respect to a point x on its surface is obtained by cutting the surface along the shortest paths from x to every vertex, and flattening the surface on the plane. We establish two main properties of the star unfolding: 1. It does not self-overlap: it is a simple polygon. 2. The ridge tree in the unfolding, which is the locus of points with more than one shortest path from x, is precisely the Voronoi diagram of the images of x, restricted to the unfolding. These two properties permit conceptual simplification of several algorithms concerned with shortest paths on polytopes, and sometimes a worst-case complexity improvement as well: • The construction of the ridge tree (in preparation for shortest-path queries, for instance) can be achieved by an especially simple O(n2) algorithm. This is no worst-case complexity improvement, but a considerable simplification nonetheless. • The exact set of all shortest-path "edge sequences" on a polytope can be found by an algorithm considerably simpler than was known previously, with a time improvement of roughly a factor of n over the old bound of O(n7 log n). • The geodesic diameter of a polygon can be found in O(n9 log n) time, an improvement of the previous best O(n10) algorithm. Our results suggest conjectures on "unfoldings" of general convex surfaces.

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

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

    U2 - 10.1007/BF02293047

    DO - 10.1007/BF02293047

    M3 - Article

    VL - 8

    SP - 219

    EP - 250

    JO - Discrete and Computational Geometry

    JF - Discrete and Computational Geometry

    SN - 0179-5376

    IS - 1

    ER -