Interactive 3D applications require fast detection of objects colliding with the environment. One popular method for fast collision detection is to offset the geometry of the envi...
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...