An Optimal Algorithm for Finding the Kernel of a Polygon
Journal of the ACM (JACM)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Computational geometry.
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines
IEEE Transactions on Computers
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Reconsider the state minimization problem for stochastic finite state systems
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
| Hi-index | 14.98 |
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.