Algorithm for computer control of a digital plotter
Seminal graphics
Multidimensional binary search trees used for associative searching
Communications of the ACM
Auto-Adaptive Step Straight-Line Algorithm
IEEE Computer Graphics and Applications
The Cg Tutorial: The Definitive Guide to Programmable Real-Time Graphics
The Cg Tutorial: The Definitive Guide to Programmable Real-Time Graphics
Migrating to a real-time distributed parallel simulator architecture
Proceedings of the 2007 Summer Computer Simulation Conference
Computer Graphics in C#: Principles and Practices
Computer Graphics in C#: Principles and Practices
CGIM '07 Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging
| Hi-index | 0.00 |
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and battlefield simulators. Due to the importance of optimum utilisation of computing resources, a number of LOS algorithms are reported in the literature to either efficiently compute LOS information or reduce the impact of LOS queries on the run-time performance of synthetic environments. From the literature it is known that a k-dimensional tree (kd-tree) based raytracing approach, to calculating LOS information, is efficient. A new implicit min/max kd-tree algorithm is discussed for evaluating LOS queries on large scale spherical terrain. In particular the value of low resolution boundary information, in quickly evaluating the LOS query, is emphasised. The min/max algorithm is empirically compared to other LOS approaches that have either implicitly or explicitly used kd-trees to optimise LOS query evaluation. The min/max algorithm is shown to have comparable performance to these existing LOS algorithms for flat earth, but improved performance when the application domain is extended to spherical earth. An average of a factor 3.0 performance increase is experienced over that of the existing implicit and explicit max kd-tree algorithms on spherical earth. This is achieved by combining the existing kd-tree algorithm with the classic smooth-earth LOS obscuration test and from there the min in min/max kd-tree.