Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Machine Learning
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
V-Clip: fast and robust polyhedral collision detection
ACM Transactions on Graphics (TOG)
Hardware-assisted virtual collisions
VRST '98 Proceedings of the ACM symposium on Virtual reality software and technology
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
A Tutorial on Support Vector Machines for Pattern Recognition
Data Mining and Knowledge Discovery
Obstacle Collision Detection Using Best Ellipsoid Fit
Journal of Intelligent and Robotic Systems
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Asymptotic behaviors of support vector machines with Gaussian kernel
Neural Computation
SVMTorch: support vector machines for large-scale regression problems
The Journal of Machine Learning Research
Classifying large data sets using SVMs with hierarchical clusters
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
Extracting important sentences with support vector machines
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Interactive collision detection between deformable models using chromatic decomposition
ACM SIGGRAPH 2005 Papers
Working Set Selection Using Second Order Information for Training Support Vector Machines
The Journal of Machine Learning Research
The priority R-tree: A practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms (TALG)
A fast iterative nearest point algorithm for support vector machine classifier design
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
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.