Hybrid bounding volume hierarchies for fast proximity queries

Dae-Hyun Kim; Han-Soo Choi

doi:10.1117/12.664473

20 February 2006 Hybrid bounding volume hierarchies for fast proximity queries

Dae-Hyun Kim, Han-Soo Choi

Proceedings Volume 6041, ICMIT 2005: Information Systems and Signal Processing; 60412O (2006) https://doi.org/10.1117/12.664473
Event: ICMIT 2005: Merchatronics, MEMS, and Smart Materials, 2005, Chongqing, China

Abstract

A collision query determines the intersection between given objects, and is used in computer-aided design and manufacturing, animation and simulation systems, and physically-based modeling. Bounding volume hierarchies are one of the simplest and most widely used data structures for performing collision detection on complex models. This paper presented hierarchy of oriented rounded bounding volume for fast proximity queries. Designing hierarchies of new bounding volumes was use to combine multiple bounding volume types in a single hierarchy. The new bounding volume corresponds to geometric shape composed of a core primitive shape grown outward by some offset such as the Minkowski sum of rectangular box and a sphere shape. In the experiment of parallel close proximity, a number of benchmarks to measure the performance of the new bounding box and compare to that of other bounding volumes.

Citation Download Citation

Dae-Hyun Kim and Han-Soo Choi "Hybrid bounding volume hierarchies for fast proximity queries", Proc. SPIE 6041, ICMIT 2005: Information Systems and Signal Processing, 60412O (20 February 2006); https://doi.org/10.1117/12.664473

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available