pith. sign in

arxiv: 1402.5303 · v3 · pith:CKRUK4WFnew · submitted 2014-02-21 · 💻 cs.CG

Diffuse Reflection Radius in a Simple Polygon

classification 💻 cs.CG
keywords diffusepointpolygonsimplereflectionssingletimeadditive
0
0 comments X
read the original abstract

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(n\log 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.