Abstract
Consider any real structure that can be modeled by a set of straight line segments. This can be a network of streets in a city, tunnels in a mine, corridors in a building, pipes in a factory, etc. We want to approximate a minimal number of locations where to place “guards” (either men or machines), in a way that any point of the network can be “seen” by at least one guard. A guard can see all points on segments it is on (and nothing more). As the problem is known to be NP-hard, we consider three greedy-type algorithms for finding approximate solutions. We show that for each of these, theoretically the ratio of the approximate to the optimal solution can increase without bound with the increase of the number of segments. Nevertheless, our extensive experiments show that on randomly generated instances, the approximate solutions are always very close to the optimal ones and often are, in fact, optimal.
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
Bose, P., Kirkpatrick, D., Li, Z.: Worst-case-optimal algorithm for guarding planar graphs and polyhedral surfaces. Computational Geometry: Theory and Applications 26(3), 209–219 (2003)
Brimkov, V.E., Leach, A., Mastroianni, M., Wu, J.: Guarding a set of line segments in the plane. Theoretical Computer Science (2010), doi:10.1016/j.tcs.2010.08.014
Brunn, H.: Über Kerneigebiete. Matt. Ann. 73, 436–440 (1913)
Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman & Company, San Francisco (1979)
Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computation, pp. 85–103. Plenum Press, New York (1972)
Ǩaucic, B., Žalik, B.: A new approach for vertex guarding of planar graphs. J. of Computing and Information Technology - CIT 10(3), 189–194 (2002)
Krasnoselśkii, M.A.: Sur un Critère pour qu’un Domain Soit Étoilé. Mat. Sb. 19, 309–310 (1946)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)
Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization. Prentice-Hall, New Jersey (1982)
Urrutia, J.: Art Gallery and Illumination Problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, ch. 22. North Holland, Amsterdam (2000)
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
Brimkov, V.E., Leach, A., Mastroianni, M., Wu, J. (2010). Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2010. Lecture Notes in Computer Science, vol 6453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17289-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-17289-2_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17288-5
Online ISBN: 978-3-642-17289-2
eBook Packages: Computer ScienceComputer Science (R0)