• Citer

The complexity of diffuse reflections in a simple polygon

par Aronov, Boris B.;Davis, Alan A.R.;Iacono, John ;Yu, Albert Siu Cheong
Référence Lecture notes in computer science, 3887, page (93-104)
Publication Publié, 2006

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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]. © Springer-Verlag Berlin Heidelberg 2006.