Visibility with multiple reflections

Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar P. Pal, D. Chithra Prasad

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

    Abstract

    We show that the region lit by a point fight source inside a simple n-gon after at most k reflections off the boundary has combinatorial complexity O(n2k), for any k > 1. A lower bound of Ω((n/k)2k) is also established which matches the upper bound for any fixed k. A simple near-optimal algorithm for computing the illuminated region is presented, which runs in O(n2k log n) time and O(n2k) space for any k>1.

    Original languageEnglish (US)
    Title of host publicationAlgorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings
    PublisherSpringer Verlag
    Pages284-295
    Number of pages12
    Volume1097
    ISBN (Print)3540614222, 9783540614227
    StatePublished - 1996
    Event5th Scandinavian Workshop on Algorithm Theory, SWAT 1996 - Reykjavik, Iceland
    Duration: Jul 3 1996Jul 5 1996

    Publication series

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

    Other

    Other5th Scandinavian Workshop on Algorithm Theory, SWAT 1996
    CountryIceland
    CityReykjavik
    Period7/3/967/5/96

    Fingerprint

    Visibility
    Combinatorial Complexity
    n-gon
    Point Source
    Optimal Algorithm
    Lower bound
    Upper bound
    Computing

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Aronov, B., Davis, A. R., Dey, T. K., Pal, S. P., & Chithra Prasad, D. (1996). Visibility with multiple reflections. In Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings (Vol. 1097, pp. 284-295). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1097). Springer Verlag.

    Visibility with multiple reflections. / Aronov, Boris; Davis, Alan R.; Dey, Tamal K.; Pal, Sudebkumar P.; Chithra Prasad, D.

    Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings. Vol. 1097 Springer Verlag, 1996. p. 284-295 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1097).

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

    Aronov, B, Davis, AR, Dey, TK, Pal, SP & Chithra Prasad, D 1996, Visibility with multiple reflections. in Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings. vol. 1097, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1097, Springer Verlag, pp. 284-295, 5th Scandinavian Workshop on Algorithm Theory, SWAT 1996, Reykjavik, Iceland, 7/3/96.
    Aronov B, Davis AR, Dey TK, Pal SP, Chithra Prasad D. Visibility with multiple reflections. In Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings. Vol. 1097. Springer Verlag. 1996. p. 284-295. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Aronov, Boris ; Davis, Alan R. ; Dey, Tamal K. ; Pal, Sudebkumar P. ; Chithra Prasad, D. / Visibility with multiple reflections. Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings. Vol. 1097 Springer Verlag, 1996. pp. 284-295 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{44b8fe056ee94114a0392f3846e6e918,
    title = "Visibility with multiple reflections",
    abstract = "We show that the region lit by a point fight source inside a simple n-gon after at most k reflections off the boundary has combinatorial complexity O(n2k), for any k > 1. A lower bound of Ω((n/k)2k) is also established which matches the upper bound for any fixed k. A simple near-optimal algorithm for computing the illuminated region is presented, which runs in O(n2k log n) time and O(n2k) space for any k>1.",
    author = "Boris Aronov and Davis, {Alan R.} and Dey, {Tamal K.} and Pal, {Sudebkumar P.} and {Chithra Prasad}, D.",
    year = "1996",
    language = "English (US)",
    isbn = "3540614222",
    volume = "1097",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "284--295",
    booktitle = "Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings",

    }

    TY - GEN

    T1 - Visibility with multiple reflections

    AU - Aronov, Boris

    AU - Davis, Alan R.

    AU - Dey, Tamal K.

    AU - Pal, Sudebkumar P.

    AU - Chithra Prasad, D.

    PY - 1996

    Y1 - 1996

    N2 - We show that the region lit by a point fight source inside a simple n-gon after at most k reflections off the boundary has combinatorial complexity O(n2k), for any k > 1. A lower bound of Ω((n/k)2k) is also established which matches the upper bound for any fixed k. A simple near-optimal algorithm for computing the illuminated region is presented, which runs in O(n2k log n) time and O(n2k) space for any k>1.

    AB - We show that the region lit by a point fight source inside a simple n-gon after at most k reflections off the boundary has combinatorial complexity O(n2k), for any k > 1. A lower bound of Ω((n/k)2k) is also established which matches the upper bound for any fixed k. A simple near-optimal algorithm for computing the illuminated region is presented, which runs in O(n2k log n) time and O(n2k) space for any k>1.

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

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

    M3 - Conference contribution

    SN - 3540614222

    SN - 9783540614227

    VL - 1097

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

    SP - 284

    EP - 295

    BT - Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings

    PB - Springer Verlag

    ER -