Sciweavers

Share
GRAPHICSINTERFACE
2000

Dynamic Plane Shifting BSP Traversal

11 years 2 months ago
Dynamic Plane Shifting BSP Traversal
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 environment according to the dimensions of the object, and then represent the object as a point (and the object's movement as a line segment). Previously, this geometry offset has been done in a preprocessing step and therefore requires knowledge of the object's dimensions before runtime. Furthermore, an extra copy of the environment's geometry is required for each shape used in the application. This paper presents a variation of the BSP tree collision algorithm that shifts the planes in order to offset the geometry of the environment at runtime. To prevent unwanted cases where offset geometry protrudes too much, extra plane equations, which bevel solid cells of space during expansion, are added by simply inserting extra nodes at the bottom of the tree. A simple line segment check can be used for c...
Stan Melax
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2000
Where GRAPHICSINTERFACE
Authors Stan Melax
Comments (0)
books