Abstract
We review important algorithmic results for the coverage of 1.5D terrain by point guards. Finding the minimum number of point guards for covering 1.5D terrain is known to be NP-hard. We propose an approximation algorithm for covering 1.5D terrain by a few number of point guards. The algorithm which we call Greedy Ranking Algorithm is based on ranking vertices in term of number of visible edges from them. We also present an improvement of the Greedy Ranking Algorithm by making use of visibility graph of the input terrain.
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
References
O’Rourke, J.: Computational geometry in C. Cambridge University Press, Cambridge (1998)
Gewali, L.P.: Recognizing s-star polygons. Pattern Recogn. 28(7), 1019–1032 (1995)
Vassilev, T., Pape, S.: Visibility: finding the staircase kernel in orthogonal polygons. Essay Math Stat. 2(05), 79–89 (2012)
O’Rourke, J.: Art gallery theorems and algorithms, vol. 57. Oxford University Press, Oxford (1987)
De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational geometry. In: Computational geometry, pp. 1–17. Springer, Berlin (2000)
Lee, D., Lin, A.: Computational complexity of art gallery problems. IEEE Trans Inform Theory. 32(2), 276–282 (1986)
King, J., Krohn, E.: Terrain guarding is np-hard. SIAM J Comput. 40(5), 1316–1339 (2011)
Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 29. Freeman, New York (2002)
Gewali, L., Dahal, B.: Algorithms for tower placement on terrain. Adv Intell Syst Comput. 36(6), 551–556 (2019)
Lai, W.-Y., Hsiang, T.-R.: Continuous terrain guarding with two-sided guards. CCCG. 2018, 247–252 (2018)
Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons(report). Discr Appl Math. 158, 6 (2010)
Ben-Moshe, B., Katz, M., Mitchell, J.: A constant-factor approximation algorithm for optimal terrain guarding. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA ’05. Society for Industrial and Applied Mathematics, pp. 515–524 (2005)
Ghosh, S.K., Mount, D.M.: An output sensitive algorithm for computing visibility graphs. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 11–19 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Gewali, L., Khatiwada, J. (2020). Fast Heuristics for Covering 1.5D Terrain. In: Latifi, S. (eds) 17th International Conference on Information Technology–New Generations (ITNG 2020). Advances in Intelligent Systems and Computing, vol 1134. Springer, Cham. https://doi.org/10.1007/978-3-030-43020-7_75
Download citation
DOI: https://doi.org/10.1007/978-3-030-43020-7_75
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43019-1
Online ISBN: 978-3-030-43020-7
eBook Packages: EngineeringEngineering (R0)