@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",

doi = "10.1007/3-540-61422-2_139",

language = "English (US)",

isbn = "3540614222",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "284--295",

editor = "Rolf Karlsson and Andrzej Lingas",

booktitle = "Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings",

note = "5th Scandinavian Workshop on Algorithm Theory, SWAT 1996 ; Conference date: 03-07-1996 Through 05-07-1996",

}