Databases and Information Systems Commons^™

Multiple Bounding Boxes Algorithm In Collision Detection And Its Performances In Sequential Vs Cuda Parallel Processing, Min Qi

Electronic Theses and Dissertations

The traditional method for detecting collisions in a 2D computer game uses a axisaligned bounding box around each sprite, and checks to determine if the bounding boxes overlap periodically. Using this single bounding box method may result in a large amount of pixel intersection tests, since a sprite may be composed of areas where the pixels are empty and the intersecting bounding box test results in false positives.

Our algorithm analysis shows that the optimal two or three bounding boxes is the best partition we can get for a reasonable time complexity. The results further show significantly diminishing returns for …