Data Structures and Algorithms

    

Optimizing the Collision Detection

Authors: Abhinav Sagar

Collision detection is the computational problem of detecting the intersection of two or more objects. While collision detection is most often associated with its use in video games and other physical simulations, it also has applications in robotics. In addition to determining whether two objects have collided, collision detection systems may also calculate time of impact, and report a contact manifold. Collision detection is one of the most challenging and complex parts of game programming and is the key area where performance is usually lost. To solve this there are a lot of data structures that eliminate unnecessary checks for collisions like quadtrees, octrees, BSP trees, grids etc.

Comments: 23 Pages.

Download: PDF

Submission history

[v1] 2020-05-09 05:04:06

Unique-IP document downloads: 863 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus