par Fox-Epstein, Eli;Tóth, Csaba C.D.;Winslow, Andrew 
Référence Algorithmica, 76, 4, page (910-931)
Publication Publié, 2016-12
Référence Algorithmica, 76, 4, page (910-931)
Publication Publié, 2016-12
Article révisé par les pairs
| Résumé : | It is shown that every simple polygon in general position with n walls can be illuminated from a single point light source s after at most ⌊ (n- 2) / 4 ⌋ diffuse reflections, and this bound is the best possible. A point s with this property can be computed in O(nlog n) time. It is also shown that the minimum number of diffuse reflections needed to illuminate a given simple polygon from a single point can be approximated up to an additive constant in polynomial time. |
