DocumentCode
1966591
Title
Distance computation using OBB-trees
Author
Diktas, Engin Deniz ; Sahiner, Ali Vahit
Author_Institution
Comput. Eng. Dept., Bogazici Univ., Istanbul, Turkey
fYear
2009
fDate
14-16 Sept. 2009
Firstpage
426
Lastpage
431
Abstract
Distance computation between geometric models plays an important role in a variety of areas such as robotics and computer graphics. In this paper we present a hierarchical method for computing the distance between two triangular mesh objects. Our method is based on direct utilization of OBB-trees. The only alternative method which uses OBB-trees for distance calculation is the swept-sphere-trees (SST) method where OBBs are indirectly used for construction. Our method employs an alignment scheme proposed for OBB-OBB intersection tests in the distance calculation context. This alignment allows us to reduce the OBB-OBB distance problem to computing the distance between two AABBs. In this paper we also propose an evaluation method, where we measure the parameters affecting the computation time as a function of the distance between object pairs. This allows an effective comparison of the bounding volumes under consideration. Using this scheme we compare the performance of the proposed method with the SST-method which is widely used for distance computation.
Keywords
mesh generation; network theory (graphs); trees (mathematics); OBB-trees; distance calculation; distance computation; geometric model; swept-sphere-trees; triangular mesh objects; Computational modeling; Computer graphics; Motion planning; Robot motion; Robotic assembly; Skeleton; Solid modeling; Testing; Time measurement; Virtual reality;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Sciences, 2009. ISCIS 2009. 24th International Symposium on
Conference_Location
Guzelyurt
Print_ISBN
978-1-4244-5021-3
Electronic_ISBN
978-1-4244-5023-7
Type
conf
DOI
10.1109/ISCIS.2009.5291854
Filename
5291854
Link To Document