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 Sharareh Alipour

Mobile ad hoc networks (MANETs) have been turned into very attractive area of research in the duration of recent years, whereas security is the most challenging point that they undergo. Cryptography is an essential solution for providing security within MANETs. However, storing all keys in every node, if practically possible, is inefficient in large scale MANETs due to some limitations such as memory or process capability. This paper extends our previous idea which was a novel probabilistic key management algorithm that stores only a few randomly chosen keys instead of all ones. In this paper, several different scenarios are proposed for key selection in which they are more practical, and then, the impact of each scenario on the performance and security metrics is analyzed. Results show that the proposed scenarios can reduce the path length in addition to keeping the network highly connected.