Visibility problems for polyhedral terrains
Journal of Symbolic Computation
An efficient algorithm for terrain simplification
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal triangulation and quadric-based surface simplification
Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
Radio Propagation in Cellular Networks
Radio Propagation in Cellular Networks
Visibility preserving terrain simplification: an experimental study
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms
Approximating the Visible Region of a Point on a Terrain
Geoinformatica
Computing radio paths in an urban environment
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
An empirically based path loss model for wireless channels in suburban environments
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Given a terrain T and an antenna A located on it, we would like to approximate the Radio Map of A over T, namely, to associate a signal strength for each point p驴T as received from A. This work presents a new Radio Map approximation algorithm using an adaptive radial sweep-line technique. The suggested radar-like algorithm (RLA) uses a pipe-line method for computing the signal strength along points on a ray, and an adaptive method for interpolating the signal strength over regions between two consecutive rays. Whenever the difference between two consecutive rays is above a certain threshold, a middle ray is created. Thus, the density of the sampling rays is sensitive to the shape of the terrain. Finally, we report on an experiment which compares the new algorithm with other well-known methods. The main conclusion is that the new RLA is significantly faster than the others, i.e., its running time is 3---15 times faster for the same approximation accuracy.