Expanding spheres: A collision detection algorithm for interest management in networked games

Morgan, G; Storey, K; Lu, FY

doi:10.1007/978-3-540-28643-1_56

Expanding spheres: A collision detection algorithm for interest management in networked games

Lookup NU author(s): Professor Graham Morgan ORCiD, Kier Storey, Fengyun Lu

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

We present a collision detection algorithm (Expanding Spheres) for interest management in networked games. The aim of all interest management schemes is to identify when objects that inhabit a virtual world should be interacting and to enable such interaction via message passing while preventing objects that should not be interacting from exchanging messages. Preventing unnecessary message exchange provides a more scalable solution for networked games. A collision detection algorithm is required by interest management schemes as object interaction is commonly determined by object location in the virtual world: the closer objects are to each other the more likely they are to interact. The collision detection algorithm presented in this paper is designed specifically for interest management schemes and produces accurate results when determining object interactions. We present performance figures that indicate that our collision detection algorithm is scalable.