Shortest watchman routes in simple polygons
Discrete & Computational Geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Information Sciences: an International Journal
Shortest zookeeper's routes in simple polygons
Information Processing Letters
Fast computation of shortest watchman routes in simple polygons
Information Processing Letters
An O(n log n) algorithm for the zoo-keeper's problem
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Finding shortest safari routes in simple polygons
Information Processing Letters
An approximative solution to the Zookeeper's Problem
Information Processing Letters
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
| Hi-index | 0.90 |
Let P be a simple polygon, and let p be a set of disjoint convex polygons inside P, each sharing one edge with P. The zookeeper's route problem asks for a shortest route inside P that visits (but does not enter) each polygon in p. We present an O(n) time algorithm for computing a zookeeper's route of length at most 2 times that of the shortest zookeeper's route. Our result improves upon the previous approximation factor 6.