Experimental Comparison of d-Rectangle Intersection Algorithms Applied to HLA Data Distribution
Mikel D. Petty · 1997
The High Level Architecture (HLA) is a standard for constructing distributed simulations. The Data Distribution Management services of HLA reduce the amount of data delivered to an HLA federate by allowing communications connections to be based on federates’ expressed data production and requirements. At the core of determining which connections to make is a geometric problem: finding the dynamic intersection of d-dimensional rectilinear hyperrectangles in d-space. Four different algorithms for solving that problem are described, including a new one developed through application of a data structure from computational geometry. Those algorithms are then compared in an experiment designed to reveal how well they perform in the specific context of the data distribution application. Both intersection performance and connectivity efficiency results are reported.