Information Processing Letters
Introduction to algorithms
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
Minimal link visibility paths inside a simple polygon
Computational Geometry: Theory and Applications
Finding an approximate minimum-link visibility path inside a simple polygon
Information Processing Letters
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Fast computation of shortest watchman routes in simple polygons
Information Processing Letters
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Traversing a set of points with a minimum number of turns
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Delineating boundaries for imprecise regions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Watchman tours for polygons with holes
Computational Geometry: Theory and Applications
On covering points with minimum turns
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Improved FPT algorithms for rectilinear k-links spanning path
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Computational geometry column 54
ACM SIGACT News
Covering paths for planar point sets
GD'12 Proceedings of the 20th international conference on Graph Drawing
Optimal patrolling of fragmented boundaries
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.89 |
We consider the problem of computing a watchman route in a polygon with holes. We show that the problem of finding a minimum-link watchman route is NP-complete, even if the holes are all convex. The proof is based on showing that the related problem of finding a minimum-link tour on a set of points in the plane is NP-complete. We provide a provably good approximation algorithm that achieves an approximation factor of O(log n ).