SCG '86 Proceedings of the second annual symposium on Computational geometry
Information Sciences: an International Journal
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
The Polygon Exploration Problem
SIAM Journal on Computing
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Touring a sequence of polygons
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Exploring simple grid polygons
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We consider a set of axis-parallel nonintersecting strips in the plane. An observer starts to the left of all strips and ends to the right, thus visiting all strips in the given order. A strip is inspected as long as the observer is inside the strip. How should the observer move to inspect all strips? We use the path length outside a strip as a quality measure which should be minimized. Therefore, we would like to find a directed path that minimizes the maximal measure among all strips. We present an optimal algorithm designed according to the structural properties of the optimal solution.