Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T.: Finding popular places. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 776–787. Springer, Heidelberg (2007)
Berger, F., Grüne, A., Klein, R.: How many lions can one man avoid? Technical Report 006, Department of Computer Science I, University of Bonn (2007), http://web.informatik.uni-bonn.de/I/publications/bgk-hmlcm-07.pdf
Carlsson, S., Jonsson, H.: Computing a shortest watchman path in a simple polygon in polynomial time. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 122–134. Springer, Heidelberg (1995)
Chin, W., Ntafos, S.: Optimum watchman routes. In: Proc. 2nd Annu. ACM Sympos. Comput. Geom, pp. 24–33 (1986)
Chin, W.-P., Ntafos, S.: The zookeeper problem. Inform. Sci. 63, 245–259 (1992)
Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment I: The rectilinear case. J. ACM 45(2), 215–245 (1998)
Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: Proc. 35th Annu. ACM Sympos. Theory Comput, pp. 473–482 (2003)
Hoffmann, F., Icking, C., Klein, R., Kriegel, K.: The polygon exploration problem. SIAM J. Comput. 31, 577–600 (2001)
Icking, C., Kamphans, T., Klein, R., Langetepe, E.: On the competitive complexity of navigation tasks. In: Bunke, H., Christensen, H.I., Hager, G.D., Klein, R. (eds.) Sensor Based Intelligent Robots. LNCS, vol. 2238, pp. 245–258. Springer, Berlin (2002)
Icking, C., Kamphans, T., Klein, R., Langetepe, E.: Exploring simple grid polygons. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 524–533. Springer, Heidelberg (2005)
Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633–701. Elsevier Science Publishers B.V. North-Holland, Amsterdam (2000)
Overmars, M.: Personel communication
Schwarz, H.R.: Numerical Analysis: A Comprehensive Introduction. B. G. Teubner, Stuttgart (1989)
Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: Proc. 9th Sympos. Theoret. Aspects Comput. Sci. LNCS, vol. 577, pp. 569–579. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kamphans, T., Langetepe, E. (2009). Inspecting a Set of Strips Optimally. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-03367-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03366-7
Online ISBN: 978-3-642-03367-4
eBook Packages: Computer ScienceComputer Science (R0)