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
    EditorsRolf Karlsson, Andrzej Lingas
    PublisherSpringer Verlag
    Pages284-295
    Number of pages12
    ISBN (Print)3540614222, 9783540614227
    StatePublished - Jan 1 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)0302-9743
    ISSN (Electronic)1611-3349

    Other

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

      Fingerprint

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

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