The complexity of diffuse reflections in a simple polygon

Authors:
Boris Aronov;Alan R. Davis;John Iacono;Albert Siu Cheong Yu
Affiliations:
Department of Computer and Information Science, Polytecnic University, Brooklyn, NY;Department of Computer and Information Science, Polytecnic University, Brooklyn, NY;Department of Computer and Information Science, Polytecnic University, Brooklyn, NY;Department of Computer and Information Science, Polytecnic University, Brooklyn, NY
Venue:
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Year:
2006

Citing 3
Cited 2

Visibility

Handbook of discrete and computational geometry
Visibility with multiple diffuse reflections

Computational Geometry: Theory and Applications
Visibility with reflection in triangulated surfaces

Visibility with reflection in triangulated surfaces

Algorithms for Computing Diffuse Reflection Paths in Polygons

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of the visibility region formed by a point light source after k diffuse reflections in a simple n-sided polygon is O(n9), which is the first result polynomial in n, with no dependence on k. This bound is an exponential improvement over the previous bound of O(n$^{\rm 2\lceil ({\it k}+1)/2 \rceil +1}$) due to Prasad et al.[8].