Share Email Print

Proceedings Paper

Hybrid bounding volume hierarchies for fast proximity queries
Author(s): Dae-Hyun Kim; Han-Soo Choi
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 20 February 2006
PDF: 6 pages
Proc. SPIE 6041, ICMIT 2005: Information Systems and Signal Processing, 60412O (20 February 2006); doi: 10.1117/12.664473
Show Author Affiliations
Dae-Hyun Kim, Chosun College of Science and Technology (South Korea)
Han-Soo Choi, Chosun Univ. (South Korea)

Published in SPIE Proceedings Vol. 6041:
ICMIT 2005: Information Systems and Signal Processing
Yunlong Wei; Kil To Chong; Takayuki Takahashi, Editor(s)

© SPIE. Terms of Use
Back to Top