Optimal shortest path and minimum-link path queries in the presence of obstacles

Yi-Jen Chiang, Roberto Tamassia

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

    Abstract

    We present efficient algorithms for shortest-path and minimum-link- path queries between two convex polygons inside a simple polygon, which acts as an obstacle to be avoided. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision. Performing shortest-path queries is a variation of the well studied separation problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.

    Original languageEnglish (US)
    Title of host publicationAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
    PublisherSpringer Verlag
    Pages266-277
    Number of pages12
    Volume855 LNCS
    ISBN (Print)9783540584346
    StatePublished - 1994
    Event2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
    Duration: Sep 26 1994Sep 28 1994

    Publication series

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

    Other

    Other2nd Annual European Symposium on Algorithms, ESA 1994
    CountryNetherlands
    CityUtrecht
    Period9/26/949/28/94

    Fingerprint

    Shortest path
    Query
    Path
    Convex polygon
    Data structures
    Simple Polygon
    Dynamic Environment
    Subdivision
    Data Structures
    Efficient Algorithms

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Chiang, Y-J., & Tamassia, R. (1994). Optimal shortest path and minimum-link path queries in the presence of obstacles. In Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings (Vol. 855 LNCS, pp. 266-277). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS). Springer Verlag.

    Optimal shortest path and minimum-link path queries in the presence of obstacles. / Chiang, Yi-Jen; Tamassia, Roberto.

    Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. Vol. 855 LNCS Springer Verlag, 1994. p. 266-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS).

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

    Chiang, Y-J & Tamassia, R 1994, Optimal shortest path and minimum-link path queries in the presence of obstacles. in Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. vol. 855 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 855 LNCS, Springer Verlag, pp. 266-277, 2nd Annual European Symposium on Algorithms, ESA 1994, Utrecht, Netherlands, 9/26/94.
    Chiang Y-J, Tamassia R. Optimal shortest path and minimum-link path queries in the presence of obstacles. In Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. Vol. 855 LNCS. Springer Verlag. 1994. p. 266-277. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Chiang, Yi-Jen ; Tamassia, Roberto. / Optimal shortest path and minimum-link path queries in the presence of obstacles. Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. Vol. 855 LNCS Springer Verlag, 1994. pp. 266-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{514f331ef449438d92b5f29fd444f0f1,
    title = "Optimal shortest path and minimum-link path queries in the presence of obstacles",
    abstract = "We present efficient algorithms for shortest-path and minimum-link- path queries between two convex polygons inside a simple polygon, which acts as an obstacle to be avoided. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision. Performing shortest-path queries is a variation of the well studied separation problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.",
    author = "Yi-Jen Chiang and Roberto Tamassia",
    year = "1994",
    language = "English (US)",
    isbn = "9783540584346",
    volume = "855 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "266--277",
    booktitle = "Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings",
    address = "Germany",

    }

    TY - GEN

    T1 - Optimal shortest path and minimum-link path queries in the presence of obstacles

    AU - Chiang, Yi-Jen

    AU - Tamassia, Roberto

    PY - 1994

    Y1 - 1994

    N2 - We present efficient algorithms for shortest-path and minimum-link- path queries between two convex polygons inside a simple polygon, which acts as an obstacle to be avoided. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision. Performing shortest-path queries is a variation of the well studied separation problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.

    AB - We present efficient algorithms for shortest-path and minimum-link- path queries between two convex polygons inside a simple polygon, which acts as an obstacle to be avoided. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision. Performing shortest-path queries is a variation of the well studied separation problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.

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

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

    M3 - Conference contribution

    AN - SCOPUS:85020082814

    SN - 9783540584346

    VL - 855 LNCS

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

    SP - 266

    EP - 277

    BT - Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings

    PB - Springer Verlag

    ER -