Improving computational efficiency in activity scanning discrete-event simulation through dynamic sectoring

Many classes of simulation models require both arbitrary spatial and temporal precision and must address the complexities of a multitude of asynchronous pair-wise interactions occurring among a dynamic non-uniform distribution of numerous spatial components. Current discrete-event simulation methodologies do not adequately represent the spatial relationships present in many physical systems, additionally, alternative simulation strategies based on activity scanning methodologies, while potentially capable of providing the arbitrary precision required, typically offer the unacceptable computational complexities of O(N²). A method to redress these issues is offered and discussed. The method presented dynamically sectors the trajectory space based on the number of spatial objects occupying a portion of the trajectory space (i.e. object space density). Additionally, the theoretical computational complexity associated with identifying spatial conflicts will be better than O(N²) for a nonuniform distribution of N spatial objects. Preliminary data which supports theoretical arguments are offered