By Topic

An unified framework to solve the broad and narrow phases of the collision detection problem in virtual prototype environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Figueiredo, M. ; Centre for Virtual Environments, Salford Univ., UK ; Fernando, T.

The automatic recognition of geometric constraints during user interaction in virtual assembly and maintenance operations relies in the determination of intersecting surfaces between virtual prototypes. This is a central problem in many virtual prototype applications, where it is necessary to find collisions precisely and interactively. This paper presents an unified framework, for the broad and narrow phases of the collision detection problem, to determine precisely intersecting surfaces in a virtual prototyping environment. The proposed algorithm is based on R-tree structures and on the overlapping axis-aligned bounding box (OAABB) for reducing the overall time complexity of the collision detection algorithm. We show that the OAABB concept used together with the R-tree data structure can be used effectively to eliminate the number of surfaces that cannot intersect and improve the performance. The proposed architecture also facilitates the implementation using parallel computing methods.

Published in:

Geometric Modeling and Graphics, 2003. Proceedings. 2003 International Conference on

Date of Conference:

16-18 July 2003