Abstract
We present heuristics for computing multiple watchman routes. Given a polygon (with or without holes) and a parameter k, we compute a set of k routes inside the polygon such that any point inside the polygon is visible from at least one point along one route. We measure the quality of our solutions by either the length of the longest route or the sum of the route lengths, where the goal is to minimize each. We start by computing a set of static guards [2], construct k routes that visit all the static guards and try to shorten the routes while maintaining full coverage of the polygon. We implemented the algorithm and present extensive results to evaluate our methods, including a comparison with lower bound routes based on the idea of visiting large number of visibility-independent “witness points”. Our experiments showed that for a large suite of input data our heuristics give efficient routes that are comparable with the optimal solutions.
This research has been supported by grants from the National Science Foundation (CCF-0528209, CCF-0729019).
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
Alsuwaiyel, M.H., Lee, D.T.: Finding an approximate minimum-link visibility path inside a simple polygon. Inf. Proc. Lett. 55(2), 59–79 (1995)
Amit, Y., Mitchell, J., Packer, E.: Locating guards for visibility coverage of polygons. In: Workshop on Algorithm Engineering and Experiments, ALENEX (2007)
Arkin, E., Mitchell, J., Piatko, C.: Minimum-link watchman tours. Technical Report, University at Stony Brook (1994)
Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Canad. Conf. Computat. Geometry (1996)
Carlsson, S., Jonsson, H., Nilsson, B.J.: Finding the shortest watchman route in a simple polygon. In: ISAAC: 4th International Symposium on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), Organized by Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan (IPSJ) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers (IEICE)) (1993)
Carlsson, S., Nilsson, B.J., Ntafos, S.C.: Optimum guard covers and m-watchmen routes for restricted polygons. In: Workshop on Algorithms and Data Structures, pp. 367–378 (1991)
The CGAL User Manual, Version 3.1 (2004), www.cgal.org
Chin, W., Ntafos, S.: Optimum watchman routes. Inform. Process. Lett. (1988)
Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, CMU (1976)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
Gewali, L., Ntafos, S.C.: Watchman routes in the presence of a pair of convex polygons. Information Sciences 105(1-4), 123–149 (1998)
Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility graphs. SIAM J. computing, 888–910 (1991)
Icking, C., Klein, R.: The two guards problem. International Journal of Computational Geometry and Applications 2(3), 257–285 (1992)
Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Info. Th IT-32, 276–282 (1986)
Mitchell, J., Wynters, E.: Watchman routes for multiple guards. In: Proc. 3th Canad. Conf. Computat. Geometry, pp. 126–129 (1991)
Nilsson, B.: Guarding art galleries - methods for mobile guards. PhD thesis, Lund University (1995)
O’Rourke, J.: Art gallery theorems and algorithms. Oxford University Press, Oxford (1987)
Park, S.-M., Lee, J.-H., Chwa, K.-Y.: Visibility-based pursuit-evasion in a polygonal region by a searcher. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, Springer, Heidelberg (2001)
Shermer, T.: Recent results in art galleries. In: Proc. of the IEEE, pp. 1384–1399 (1992)
Tan, X.: Fast computation of shortest watchman routes in simple polygons. Inf. Proc. Lett. 77, 27–33 (2001)
Tan, X., Hirata, T., Inagaki, Y.: An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geometry Appl (IJCGA) 3(4), 351–365 (1993)
Urrutia, J.: Art gallery and illumination problems. In: Sac, J., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973–1027. Elsevier Science Publishers, Amsterdam (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Packer, E. (2008). Computing Multiple Watchman Routes. In: McGeoch, C.C. (eds) Experimental Algorithms. WEA 2008. Lecture Notes in Computer Science, vol 5038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68552-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-68552-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68548-7
Online ISBN: 978-3-540-68552-4
eBook Packages: Computer ScienceComputer Science (R0)