19 April 1995 Intervisibility heuristics for computer generated forces
Author Affiliations +
Abstract
Intervisibility between entities in a Distributed Interactive Simulation (DIS) environment is a mandatory, computationally expensive process. A Computer Generated Forces (CGF) system must determine the intervisibility status between each of its controlled entities and each of the other entities in the simulation and it must make these determinations at frequent intervals. Previous work has focused on developing algorithms to perform intervisibility determinations as quickly as possible. In this work, the problem was approached differently. Instead of speeding each intervisibility determination, heuristics were developed for reducing the number of determinations needed, thereby reducing the computational expense of intervisibility. These results are independent of terrain representation and thereby applicable to any CGF system.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sumeet Rajput, Sumeet Rajput, Clarke R. Karr, Clarke R. Karr, Mikel D. Petty, Mikel D. Petty, Michael A. Craft, Michael A. Craft, } "Intervisibility heuristics for computer generated forces", Proc. SPIE 10280, Distributed Interactive Simulation Systems for Simulation and Training in the Aerospace Environment: A Critical Review, 102800K (19 April 1995); doi: 10.1117/12.204226; https://doi.org/10.1117/12.204226
PROCEEDINGS
29 PAGES


SHARE
RELATED CONTENT

Ant algorithm in OBS RWA
Proceedings of SPIE (February 11 2005)
Recent advances on terrain database correlation testing
Proceedings of SPIE (August 24 1998)
Quasi-symplectic stochastic integration
Proceedings of SPIE (May 25 2004)
Computer Generated Graphics A Review Of Some Of The More...
Proceedings of SPIE (September 01 1975)
Time-realistic 3D computer graphics (CG) simulator sight
Proceedings of SPIE (March 30 1995)

Back to Top