Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Computational complexity of art gallery problems
IEEE Transactions on Information Theory
Information Processing Letters
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The art gallery theorem: its variations, applications and algorithmic aspects
The art gallery theorem: its variations, applications and algorithmic aspects
| Hi-index | 0.00 |
We present a fast algorithm for computing a watchman route in a simple polygon that is at most a constant factor longer than the shortest watchman route. The algorithm runs in O(n log n) time as compared to the best known algorithm that computes a shortest watchman route which runs in O(n^6) time.