Abstract
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illuminate all intruders. We want to minimize the total distance traveled by the robot until all intruders are detected in the worst case. We present an O(nlogn) time and O(n) space algorithm for optimizing this metric, where n is the number of vertices of the given polygon. This improves upon the best known time and space complexities of O(n 2) and O(n 2), respectively. The distance graph plays a critical role in our analysis and algorithm design.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chazelle, B., Guibas, L.: Visibility and intersection problems in plane geometry. In: Proc. 3rd Annual Symp. on Computational Geometry, pp. 135–146 (1985)
Fukami, K., Ono, H., Sadakane, K., Yamashita, M.: Optimal polygon search by a boundary 1-searcher. In: Proc. Workshop on Foundations of Theoretical Computer Science: For New Computational View, RIMS, Kyoto University, January 2008, pp. 182–188 (2008)
Gabor, H., Tarjan, R.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences 30, 209–221 (1985)
Guibas, L., Latombe, J., LaValle, S., Lin, D., Motwani, R.: A visibility-based pursuit-evasion problem. Int’l. J. of Computational Geometry and Applications 9(5), 471–494 (1999)
Hopcroft, J., Ullman, J.: Set merging algorithm. SIAM J. Computing 2, 294–303 (1973)
Icking, C., Klein, R.: The two guards problem. Int’l. J. of Computational Geometry and Applications 2(3), 257–285 (1992)
Kameda, T., Suzuki, I., Zhang, Z.: Finding the minimum-distance schedule for a boundary searcher with a flashlight. Tech. Rep. TR 2009-24, School of CS, Simon Fraser Univ. (December 2009)
Kameda, T., Yamashita, M., Suzuki, I.: On-line polygon search by a seven-state boundary 1-searcher. IEEE Trans. on Robotics 22, 446–460 (2006)
Kameda, T., Zhang, J.Z., Yamashita, M.: Simple characterization of polygons searchable by 1-searcher. In: Proc. 18th Canadian Conf. on Computational Geometry, August 2006, pp. 113–116 (2006)
Suzuki, I., Tazoe, Y., Yamashita, M., Kameda, T.: Searching a polygonal region from the boundary. Int’l. J. of Computational Geometry and Applications 11(5), 529–553 (2001)
Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM J. on Computing 21(5), 863–888 (1992)
Tan, X.: A characterization of polygonal regions searchable from the boundary. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol. 3330, pp. 200–215. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kameda, T., Suzuki, I., Zhang, J.Z. (2010). Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. In: López-Ortiz, A. (eds) LATIN 2010: Theoretical Informatics. LATIN 2010. Lecture Notes in Computer Science, vol 6034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12200-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-12200-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12199-9
Online ISBN: 978-3-642-12200-2
eBook Packages: Computer ScienceComputer Science (R0)