By Topic

Efficient Collision Detection Using a Dual K-DOP-Sphere Bounding Volume Hierarchy

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

3 Author(s)

Collision detection is of paramount importance for many applications in computer graphics and visualization. In this research, we present an efficient algorithm for collision detection using a dual bounding hierarchy which consists of an discrete orientation polytopes (k-DOPs) tree enhanced with bounding sphere. The algorithm combines the compactness of the k-DOP and the efficient overlap test for spheres. The more efficient sphere test is applied firstly to eliminate distant objects. The remaining objects are in close proximity are tested using separation axis, where some separation axis are more effective and should be chosen first. We apply the efficient approach to the virtual acupuncture medical treatment systems, and the experimental results show that the new algorithm effectively reduces the query time and enhances the reality character with respect to the existing collection detection algorithms.

Published in:

Information Technology and Applications (IFITA), 2010 International Forum on  (Volume:3 )

Date of Conference:

16-18 July 2010