Title: Proximity queries using separating bounding volumes

Authors: Yi Wang, Wen-hui Li, Yi Li, Zi-hou Ge

Addresses: Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education, College of Computer Science and Technology, Jilin University, ChangChun, China. ' Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education, College of Computer Science and Technology, Jilin University, ChangChun, China. ' Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education, College of Computer Science and Technology, Jilin University, ChangChun, China. ' Aviation University of Airforce, ChangChun, China

Abstract: This paper presents a fast method for collision detection and proximity queries for 3D models using Separating Bounding Volumes (SBVs). In order to achieve real-time performance for complex, non-convex models, we propose an algorithm to speed-up the computation of SBVs by using the support vector machines and a robust scheme to conduct penetration search under the framework of SBVs. The SBVs-based proximity queries require no specific knowledge of the object|s geometry or topology. The examples indicate that this method, the meaningful local penetration information can be computed for complex models within a few milliseconds.

Keywords: collision detection; separating bounding volumes; SVM; support vector machines; proximity queries; 3D modelling.

DOI: 10.1504/IJCAT.2010.034162

International Journal of Computer Applications in Technology, 2010 Vol.38 No.1/2/3, pp.40 - 48

Available online: 16 Jul 2010

Full-text access for editors Access for subscribers Purchase this article Comment on this article