By Topic

Evaluation of splitting methods in top-down OBB-tree construction

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)
Diktas, E.D. ; Dept. of Comput. Eng., Bogazici Univ., Istanbul ; Sahiner, A.V.

The Oriented Bounding Box trees (OBB-trees) offer efficient means for real-time collision detection between geometric models. The efficiency of the OBB-tree in answering the queries depends mainly on the way the triangles are splitted and distributed to the child nodes. In this paper we examine four different partitioning methods for top-down construction of OBB-trees and compare their performance in three different types of queries: collision detection between two objects, finding the triangle closest to a given point and extremal point queries. In addition to the examined methods we also offer a method for determining and splitting disconnected sets of triangles at an early stage during the hierarchy construction.

Published in:

Computer and Information Sciences, 2008. ISCIS '08. 23rd International Symposium on

Date of Conference:

27-29 Oct. 2008