2014/02/21 by Eli Fox-Epstein, Csaba Tóth, Fox-Epstein, Eli +4
Computer Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #Digital Image Processing Techniques #FOS: Computer and information sciences #cs.CG
paper · pdf · doi:10.48550/arxiv.1402.5303
openalex publication_date 2014/02/21 · arxiv created 2015/05/17 · arxiv updated 2015/05/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 \lfloor (n-2)/4\rfloor 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.