Visibility with multiple diffuse reflections

D.Chithra Prasad, Sudebkumar P. Pal, Tamal K. Dey
1998 Computational geometry  
The combinatorial complexity of the region lit up from a point light source inside a simple n-gon with perfectly reflecting edges, after at most k specular reflections was established as O(n 2k) (Aronov et al., 1996) . A lower bound of D((n/k) ak) was also established, matching the upper bound for any fixed k. In a real situation, surfaces may not be perfect mirrors; indeed most surfaces may be non-shiny or rough, causing diffuse reflection, rather than specular reflection. In contrast to the
more » ... sult of (Aronov et al., 1996) , the combinatorial complexity of the region lit up from a point inside a simple n-gon after k diffuse reflections is established here to be O(nZF(k+l)/2]+l).
doi:10.1016/s0925-7721(97)00021-7 fatcat:gwxvq77rqvfqvcgvszt7hsntgu