@inproceedings{bda6fa68cfd94ecc8a9466de5dc2445f,

title = "The complexity of diffuse reflections in a simple polygon",

abstract = "The complexity of the visibility region formed by a point light source after k diffuse reflections in a simple n-sided polygon is O(n°), which is the first result polynomial in n, with no dependence on k. This bound is an exponential improvement over the previous bound of O(n2[(k+1)/2]+1) due to Prasad et al. [8].",

author = "Boris Aronov and Davis, {Alan R.} and John Iacono and Yu, {Albert Siu Cheong}",

year = "2006",

doi = "10.1007/11682462_13",

language = "English (US)",

isbn = "354032755X",

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

pages = "93--104",

booktitle = "LATIN 2006",

note = "LATIN 2006: Theoretical Informatics - 7th Latin American Symposium ; Conference date: 20-03-2006 Through 24-03-2006",

}