Abstract
In the 1.5-dimensional terrain guarding problem we are given as input an x-monotone chain (the terrain) and asked for the minimum set of guards (points on the terrain) such that every point on the terrain is seen by at least one guard. It has recently been shown that the 1.5-dimensional terrain guarding problem is approximable to within a constant factor [3,7], though no attempt has been made to minimize the approximation factor. We give a 4-approximation algorithm for the 1.5D terrain guarding problem that runs in quadratic time. Our algorithm is faster, simpler, and has a better worst-case approximation factor than previous algorithms.
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
Aggarwal, A.: The art gallery problem: Its variations, applications, and algorithmic aspects. PhD thesis, Johns Hopkins University (1984)
Ben-Moshe, B.: Personal communication (2005)
Ben-Moshe, B., Katz, M., Mitchell, J.: A constant-factor approximation algorithm for optimal terrain guarding. In: Symposium on Discrete Algorithms (2005)
Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry 14 (1995)
Chen, D.Z., Estivill-Castro, V., Urrutia, J.: Optimal guarding of polygons and monotone chains (extended abstract) (1996)
Chvátal, V.: A combinatorial theorem in plane geometry. J. Comb. Theory Series B 18, 39–41 (1975)
Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. In: Symposium on Computational Geometry (2005)
Eidenbenz, S.: (In-)Approximability of Visibility Problems on Polygons and Terrains. PhD thesis, ETH Zurich (2000)
Eidenbenz, S.: Approximation algorithms for terrain guarding. Information Processing Letters 82(2), 99–105 (April 2002)
Eidenbenz, S., Stamm, C., Widmayer, P.: Positioning guards at fixed height above a terrain—an optimum inapproximability result. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, p. 187. Springer, Heidelberg (1998)
Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31(1), 79–113 (2001)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)
Garey, M., Johnson, D.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Haussler, D., Welzl, E.: ε-Nets and Simplex Range Queries. Discrete & Computational Geometry 2, 127–151 (1987)
King, J.: Approximation algorithms for the 1.5 dimensional terrain guarding problem. Master’s thesis, University of British Columbia (2005)
Kooshesh, A.A., Moret, B.M.E.: Three-coloring the vertices of a triangulated simple polygon. Pattern Recognition 25 (1992)
Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Transactions on Information Theory 32, 276–282 (1986)
Sharir, M., Agarwal, P.K.: Davenport-Schinzel sequences and their geometric applications. Technical report (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
King, J. (2006). A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_58
Download citation
DOI: https://doi.org/10.1007/11682462_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)