Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps

Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia

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

    Abstract

    We describe a new technique for dynamically maintaining the trapezoidal decomposition of a connected planar map M with n vertices, and apply it to the development of a unified dynamic data structure that supports point-location, ray-shooting, and shortest-path queries in M. The space requirement is O(n log n). Point-location queries take time O(log n). Ray-shooting and shortest-path queries take time O(log3 n) (plus O(k) time if the k edges of the shortest path are reported in addition to its length). Updates consist of insertions and deletions of vertices and edges, and take O(log3 n) time (amortized for vertex updates).

    Original languageEnglish (US)
    Title of host publicationProceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
    PublisherPubl by ACM
    Pages44-53
    Number of pages10
    StatePublished - 1993
    EventProceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms - Austin, TX, USA
    Duration: Jan 25 1993Jan 27 1993

    Other

    OtherProceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
    CityAustin, TX, USA
    Period1/25/931/27/93

    Fingerprint

    Data structures
    Decomposition

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Chiang, Y-J., Preparata, F. P., & Tamassia, R. (1993). Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 44-53). Publ by ACM.

    Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. / Chiang, Yi-Jen; Preparata, Franco P.; Tamassia, Roberto.

    Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Publ by ACM, 1993. p. 44-53.

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

    Chiang, Y-J, Preparata, FP & Tamassia, R 1993, Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Publ by ACM, pp. 44-53, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, USA, 1/25/93.
    Chiang Y-J, Preparata FP, Tamassia R. Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Publ by ACM. 1993. p. 44-53
    Chiang, Yi-Jen ; Preparata, Franco P. ; Tamassia, Roberto. / Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Publ by ACM, 1993. pp. 44-53
    @inproceedings{21d938d2312d4e2381dc3ce2bb38e974,
    title = "Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps",
    abstract = "We describe a new technique for dynamically maintaining the trapezoidal decomposition of a connected planar map M with n vertices, and apply it to the development of a unified dynamic data structure that supports point-location, ray-shooting, and shortest-path queries in M. The space requirement is O(n log n). Point-location queries take time O(log n). Ray-shooting and shortest-path queries take time O(log3 n) (plus O(k) time if the k edges of the shortest path are reported in addition to its length). Updates consist of insertions and deletions of vertices and edges, and take O(log3 n) time (amortized for vertex updates).",
    author = "Yi-Jen Chiang and Preparata, {Franco P.} and Roberto Tamassia",
    year = "1993",
    language = "English (US)",
    pages = "44--53",
    booktitle = "Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms",
    publisher = "Publ by ACM",

    }

    TY - GEN

    T1 - Unified approach to dynamic point location, ray shooting, and shortest paths in planar maps

    AU - Chiang, Yi-Jen

    AU - Preparata, Franco P.

    AU - Tamassia, Roberto

    PY - 1993

    Y1 - 1993

    N2 - We describe a new technique for dynamically maintaining the trapezoidal decomposition of a connected planar map M with n vertices, and apply it to the development of a unified dynamic data structure that supports point-location, ray-shooting, and shortest-path queries in M. The space requirement is O(n log n). Point-location queries take time O(log n). Ray-shooting and shortest-path queries take time O(log3 n) (plus O(k) time if the k edges of the shortest path are reported in addition to its length). Updates consist of insertions and deletions of vertices and edges, and take O(log3 n) time (amortized for vertex updates).

    AB - We describe a new technique for dynamically maintaining the trapezoidal decomposition of a connected planar map M with n vertices, and apply it to the development of a unified dynamic data structure that supports point-location, ray-shooting, and shortest-path queries in M. The space requirement is O(n log n). Point-location queries take time O(log n). Ray-shooting and shortest-path queries take time O(log3 n) (plus O(k) time if the k edges of the shortest path are reported in addition to its length). Updates consist of insertions and deletions of vertices and edges, and take O(log3 n) time (amortized for vertex updates).

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

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

    M3 - Conference contribution

    AN - SCOPUS:0027202918

    SP - 44

    EP - 53

    BT - Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms

    PB - Publ by ACM

    ER -