Abstract

It is shown that every simple polygon in general position with nn walls can be illuminated from a single point light source ss after at most ⌊(n−2)/4⌋\lfloor (n-2)/4\rfloor diffuse reflections, and this bound is the best possible. A point ss with this property can be computed in O(nlog⁡n)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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.