You are here

UCF Digital Collections ยป ETD Collection

AN APPROACH FOR COMPUTING INTERVISIBILITY USING GRAPHICAL PROCESSING UNITS

Download pdf | Full Screen View

Date Issued:
2004
Abstract/Description:
In large scale entity-level military force-on-force simulations it is essential to know when one entity can visibly see another entity. This visibility determination plays an important role in the simulation and can affect the outcome of the simulation. When virtual Computer Generated Forces (CGF) are introduced into the simulation these intervisibilities must now be calculated by the virtual entities on the battlefield. But as the simulation size increases so does the complexity of calculating visibility between entities. This thesis presents an algorithm for performing these visibility calculations using Graphical Processing Units (GPU) instead of the Central Processing Units (CPU) that have been traditionally used in CGF simulations. This algorithm can be distributed across multiple GPUs in a cluster and its scalability exceeds that of CGF-based algorithms. The poor correlations of the two visibility algorithms are demonstrated showing that the GPU algorithm provides a necessary condition for a "Fair Fight" when paired with visual simulations.
Title: AN APPROACH FOR COMPUTING INTERVISIBILITY USING GRAPHICAL PROCESSING UNITS.
39 views
19 downloads
Name(s): Tracy, Judd, Author
Schiavone, Guy, Committee Chair
University of Central Florida, Degree Grantor
Type of Resource: text
Date Issued: 2004
Publisher: University of Central Florida
Language(s): English
Abstract/Description: In large scale entity-level military force-on-force simulations it is essential to know when one entity can visibly see another entity. This visibility determination plays an important role in the simulation and can affect the outcome of the simulation. When virtual Computer Generated Forces (CGF) are introduced into the simulation these intervisibilities must now be calculated by the virtual entities on the battlefield. But as the simulation size increases so does the complexity of calculating visibility between entities. This thesis presents an algorithm for performing these visibility calculations using Graphical Processing Units (GPU) instead of the Central Processing Units (CPU) that have been traditionally used in CGF simulations. This algorithm can be distributed across multiple GPUs in a cluster and its scalability exceeds that of CGF-based algorithms. The poor correlations of the two visibility algorithms are demonstrated showing that the GPU algorithm provides a necessary condition for a "Fair Fight" when paired with visual simulations.
Identifier: CFE0000306 (IID), ucf:46315 (fedora)
Note(s): 2004-12-01
M.S.Cp.E.
Engineering and Computer Science, Department of Electrical and Computer Engineering
Masters
This record was generated from author submitted information.
Subject(s): intervisiblitity
occlusion
occlusion query
GPU
cluster
line-of-sight
LOS
semi-automated forces
SAF
computer generated forces
CGF
Persistent Link to This Record: http://purl.flvc.org/ucf/fd/CFE0000306
Restrictions on Access: campus 2005-01-31
Host Institution: UCF

In Collections