Diffuse Reflection Radius in a Simple Polygon

Algorithmica(2015)

引用 1|浏览30
暂无评分
摘要
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(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.
更多
查看译文
关键词
Art gallery,Visibility,Link distance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要