Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Hierarchical spherical distance fields for collision detection

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)
Funfzig, C. ; Braunschweig Univ. of Technol., Germany ; Ullrich, T. ; Fellner, D.W.

The problem of collision detection between objects is fundamental in many different communities including CAD, robotics, computer graphics, and computational geometry. This article presents a fast collision detection technique for all types of rigid bodies, demonstrated using polygon soups. We present two algorithms for computing a discrete spherical distance field of models. For compactly storing the distance field, we use a subsampling filter bank.

Published in:

Computer Graphics and Applications, IEEE  (Volume:26 ,  Issue: 1 )