Intervisibility heuristics for computer generated forces
Sumeet Rajput, Clark R. Karr, Mikel D. Petty, Michael A. Craft · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1995
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.