A One Step collision Detection Method for Computer Graphics Programs

The topic of this thesis is a collection detection algorithm for use in computer programs dealing in three dimensional graphics. Collision detection is usually accomplished by breaking the movement into small steps and checking if a collision has occurred at each of these discrete steps. This method is a very time-intensive way to detect for collisions and therefore, inefficient for a system which typically moves in large increments. For this kind of system, a method could be developed which checks once for collisions without dividing the move into multiple small increments. The subject of this paper is an algorithm, developed for use in a computer program, that will allow the user to make large movements of the objects and check for collisions quickly and efficiently