School of Technology and Computer Science Seminars
Art Gallery Problems for Visibility with Reflection
by Mr. Pritam Bhattacharya (Indian Institute of Technology, Kharagpur)
Friday, May 29, 2015
from
to
(Asia/Kolkata)
at A-212 (STCS Seminar Room)
at A-212 (STCS Seminar Room)
Description |
The art gallery problem is to determine the minimum number of point light sources positioned at vertices of a polygon that can illuminate the entire polygon. Lee and Lin showed that this problem is NP-hard for direct visibility. In this talk, we will show that this problem remains NP-hard even for visibility with reflection, considering both *specular* and *diffuse* reflections. If time permits, I'll also talk about a variant of the art gallery problem known as the kernel problem. |