Visibility queries in simple polygons and applications

Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang

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

    Abstract

    In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P. We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubic space overhead of earlier methods. The same canonical decomposition can be used to determine visibility within a frustum, or to compute various attributes of the visibility polygon efficiently. By exploring the connection between visibility polygons and shortest path trees, we obtain a kinetic algorithm that can track the visibility polygon as the viewpoint moves along polygonal paths inside P, at a polylogarithmic cost per combinatorial change in the visibility. The combination of the static and kinetic algorithms leads to a space query-time tradeoff for the visibility from a point problem and an output-sensitive algorithm for the weak visibility from a segment problem.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings
    Pages357-367
    Number of pages11
    Volume1533 LNCS
    StatePublished - 1998
    Event9th Annual International Symposium on Algorithms and Computation, ISAAC'98 - Taejon, Korea, Republic of
    Duration: Dec 14 1998Dec 16 1998

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1533 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other9th Annual International Symposium on Algorithms and Computation, ISAAC'98
    CountryKorea, Republic of
    CityTaejon
    Period12/14/9812/16/98

    Fingerprint

    Simple Polygon
    Visibility
    Query
    Polygon
    Kinetics
    Shortest Path Tree
    Truncated cone or frustum
    Canonical Decomposition
    Data structures
    Data Structures
    Disjoint
    Union
    Trade-offs
    Directly proportional
    Attribute
    Decomposition
    Path

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Aronov, B., Guibas, L. J., Teichmann, M., & Zhang, L. (1998). Visibility queries in simple polygons and applications. In Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings (Vol. 1533 LNCS, pp. 357-367). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1533 LNCS).

    Visibility queries in simple polygons and applications. / Aronov, Boris; Guibas, Leonidas J.; Teichmann, Marek; Zhang, Li.

    Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. Vol. 1533 LNCS 1998. p. 357-367 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1533 LNCS).

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

    Aronov, B, Guibas, LJ, Teichmann, M & Zhang, L 1998, Visibility queries in simple polygons and applications. in Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. vol. 1533 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1533 LNCS, pp. 357-367, 9th Annual International Symposium on Algorithms and Computation, ISAAC'98, Taejon, Korea, Republic of, 12/14/98.
    Aronov B, Guibas LJ, Teichmann M, Zhang L. Visibility queries in simple polygons and applications. In Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. Vol. 1533 LNCS. 1998. p. 357-367. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Aronov, Boris ; Guibas, Leonidas J. ; Teichmann, Marek ; Zhang, Li. / Visibility queries in simple polygons and applications. Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. Vol. 1533 LNCS 1998. pp. 357-367 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{a2610475efe04725a355842603c4ebae,
    title = "Visibility queries in simple polygons and applications",
    abstract = "In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P. We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubic space overhead of earlier methods. The same canonical decomposition can be used to determine visibility within a frustum, or to compute various attributes of the visibility polygon efficiently. By exploring the connection between visibility polygons and shortest path trees, we obtain a kinetic algorithm that can track the visibility polygon as the viewpoint moves along polygonal paths inside P, at a polylogarithmic cost per combinatorial change in the visibility. The combination of the static and kinetic algorithms leads to a space query-time tradeoff for the visibility from a point problem and an output-sensitive algorithm for the weak visibility from a segment problem.",
    author = "Boris Aronov and Guibas, {Leonidas J.} and Marek Teichmann and Li Zhang",
    year = "1998",
    language = "English (US)",
    isbn = "3540653856",
    volume = "1533 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "357--367",
    booktitle = "Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings",

    }

    TY - GEN

    T1 - Visibility queries in simple polygons and applications

    AU - Aronov, Boris

    AU - Guibas, Leonidas J.

    AU - Teichmann, Marek

    AU - Zhang, Li

    PY - 1998

    Y1 - 1998

    N2 - In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P. We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubic space overhead of earlier methods. The same canonical decomposition can be used to determine visibility within a frustum, or to compute various attributes of the visibility polygon efficiently. By exploring the connection between visibility polygons and shortest path trees, we obtain a kinetic algorithm that can track the visibility polygon as the viewpoint moves along polygonal paths inside P, at a polylogarithmic cost per combinatorial change in the visibility. The combination of the static and kinetic algorithms leads to a space query-time tradeoff for the visibility from a point problem and an output-sensitive algorithm for the weak visibility from a segment problem.

    AB - In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P. We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubic space overhead of earlier methods. The same canonical decomposition can be used to determine visibility within a frustum, or to compute various attributes of the visibility polygon efficiently. By exploring the connection between visibility polygons and shortest path trees, we obtain a kinetic algorithm that can track the visibility polygon as the viewpoint moves along polygonal paths inside P, at a polylogarithmic cost per combinatorial change in the visibility. The combination of the static and kinetic algorithms leads to a space query-time tradeoff for the visibility from a point problem and an output-sensitive algorithm for the weak visibility from a segment problem.

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

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

    M3 - Conference contribution

    SN - 3540653856

    SN - 9783540653851

    VL - 1533 LNCS

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

    SP - 357

    EP - 367

    BT - Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings

    ER -