This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimal Illumination Region Algorithm for Convex Polygons
December 1982 (vol. 31 no. 12)
pp. 1225-1227
D.T. Lee, Department of Electrical Engineering and Computer Science, Northwestern University
For the convex polygon P having n vertices entirely contained in a convex polygon K having m vertices, an optimal algorithm with running time O(n + m) is presented to compute and name regions in the boundary of K from which it is possible to illuminate the exterior of P. It is also shown that this illumination region algorithm can be used to improve the worst case O(nm) running time of a related two dimensional simplex coverability algorithm so that it too has running time O(n + m), and is thus optimal to within a constant factor.
Index Terms:
simplex covering, Computational complexity, geometric programming, optimal algorithms, probabilistic automata
Citation:
D.T. Lee, C.B., Jr. Silio, "An Optimal Illumination Region Algorithm for Convex Polygons," IEEE Transactions on Computers, vol. 31, no. 12, pp. 1225-1227, Dec. 1982, doi:10.1109/TC.1982.1675946
Usage of this product signifies your acceptance of the Terms of Use.