DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/3041

Title: Using an implicit min/max KD-Tree for doing efficient terrain line of sight calculations
Authors: Duvenhage, B
Keywords: Line of sight
Implicit kd-tree
Spherical earth
Issue Date: Feb-2009
Publisher: African Graphics Association
Citation: Duvenhage, B. 2009. Using an implicit min/max KD-Tree for doing efficient terrain line of sight calculations. 6th International Conference on Virtual Reality, Computer Graphics, Visualisation and Interaction in Africa. Centurion, South Africa, 4 - 6 February 2009, pp 10
Abstract: 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
Description: Copyright: 2004-2008 African Graphics Association
URI: http://hdl.handle.net/10204/3041
ISBN: 978-1-60558-428-7
Appears in Collections:Command control and information warfare
Radar and electronic warfare systems
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Duvenhage_2009.pdf5.41 MBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback