Approximation algorithms for visibility computation and testing over a terrain

Given a 2.5D terrain and a query point p on or above it, we want to find the triangles of terrain that are visible from p . We present an approximation algorithm to solve this problem. We implement the algorithm and test it on real data sets. The experimental results show that our approximate solution is very close to the exact solution and compared to the other similar works, the computational cost of our algorithm is lower. We analyze the computational complexity of the algorithm. We consider the visibility testing problem where the goal is to test whether a given triangle of the terrain is visible or not with respect to p . We present an algorithm for this problem and show that the average running time of this algorithm is the same as the running time of the case where we want to test the visibility between two query points p and q . We also propose a randomized algorithm for providing an estimate of the portion of the visible region of a terrain for a query point.