The Research On The Algorithm Of Fast Collision Detection Based On K-DOPS

Collision Detection is one of the basic questions in many fields, such as virtual reality, cartoon emulation, CAD, etc. Its basic task is to confirm whether two or a lot of objects are kept in touch or pierced through each other. Though people have already made a series of achievements, these algorithms lay particular emphasis on accuracy measure, and seldom involve real-time character. Following by the development of computer software,hardware and network, mutual real-time character and scene authenticity make it become a hot focus again.The main theory of this paper is the collision detection of K-DOPS bounding volume. Here do I expound the principle of the K-DOPS bounding volume. This paper brings forward and proves a rapid interval test for resolving intersection tests between bounding volumes. It determine two bounding volume do not overlap by checking if one of their bound intervals on direction axis defined by the fix direction set does not overlap. Thus the intersection test betweenm two bounding volumes need only at most k comparisons. (k is the size of fixed direction set.) Furthermore, a traverse tracing strategy that can speed up collision detection is proposed in this paper based on developing and utilizing temporal-spatial coherence in virtual environment. This is a heuristic strategy. It can reduce the intersection tests need to be computed between bounding volumes by tracing the traverse process in previous time to gain traverse path in current time. The correctness and validity of collision detection can be guaranteed by maintaining the tracing list.