Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Approximation Algorithms For Illuminating 1.5d Terrain, Jiwan Khatiwada
Approximation Algorithms For Illuminating 1.5d Terrain, Jiwan Khatiwada
UNLV Theses, Dissertations, Professional Papers, and Capstones
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 two approximation algorithms for covering 1.5D terrain by a fewer number of point guards. The first algorithm (Greedy Ranking Algorithm) is based on ranking vertices in term of number of visible edges from them. The second algorithm (Greedy Forward Marching Algorithm) works in greedy manner by scanning the terrain from left to right. Both algorithms are implemented in Python 2.7 programming language.