ISSN:
1433-3015
Keywords:
Collision detection
;
Complex
;
Dynamic
;
Static
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
Notes:
Abstract The goal of this paper is to improve the efficiency of collision detection algorithms applied to highly complex geometry scenes not having geometry coherence. Efficiency is improved by reducing the number of objects to be checked for collisions and accelerating the fundamental repeating checks on which the collision detection process relies. The number of objects to be checked is decreased by combining hierarchical representation techniques with incremental methods. The fundamental repeating check, actually a collision check between two bounding boxes, is accelerated by using 3D bounding boxes each having an associated transformation for mapping its vertices from a local to a world coordinate system (CS). This acceleration is based on the observation that two boxes (A andB) intersect if and only if the projections ofA andB intersect on all three axis-aligned orthographic views, both forA in the local CS ofB and forB in the local CS ofA. These algorithms have been successfully implemented in simulating dynamic scenes with high geometry complexity and as avirtual collision detection sensor for off-line robot motion planning.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01179419
Permalink
