| The Complexity of Diffuse Reflections in a Simple Polygon (2008) | |||||||||||||||
Abstract | |||||||||||||||
| 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 9), 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(n 2⌈(k+1)/2⌉+1) due to Prasad et al. [8]. Introduction. Visibility problems in computational and combinatorial geometry have been studied extensively (see [3, 6, 9] and references therein). We confine our attention to results in the plane, more specifically those referring to visibility inside a simple polygon P | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||