Collection of Area of Interest (AOI) Algorithms

摘要

This report presents several independently developed and tested algorithms implemented in Pascal and FORTRAN 77 for determining if a point falls within a specified quadrilateral Area of Interest (AOI). These algorithms represent several ways of mathematically solving the AOI point inclusion problem, and provide a set of unclassified benchmarks against which existing system algorithms can be evaluated. Each of the other reports, listed in Appendix A, analyzes algorithms from several existing Intelligence and Electronic Warfare I/EW systems that perform a single function and examine their underlying mathematics. The main functional areas studied have been correlation, geographic transformations, and direction finding and location (fix) estimation. In this introductory section, the basic mathematical and geometric considerations on which the AOI algorithms presented later are based will be introduced, and the potential order dependence inherent in defining a polygon by the location of its vertices discussed. The second section presents the algorithms, and the third section, an overview of testing results and algorithm evaluations.