Research on random collision detection algorithm based on improved PSO

Authors:
Ting-dong Hu
Affiliations:
Shenzhen Kunyiziyuan Electronic Ltd, Shenzhen, China
Venue:
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Year:
2011

Citing 4
Cited 0

I-COLLIDE: an interactive and exact collision detection system for large-scale environments

I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
H-Walk: hierarchical distance computation for moving convex bodies

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An Intestinal Surgery Simulator: Real-Time Collision Processing and Visualization

IEEE Transactions on Visualization and Computer Graphics
An adaptive stochastic collision detection between deformable objects using particle swarm optimization

EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to improve the real-time of collision detection algorithm, this paper introduces particle swarm optimization (PSO), PSO simple and easy to operate, and search capability and convergence speed have a greater advantage. To reduce the random collision detection algorithm missed some of the interfering elements and to improve the accuracy of collision detection, using the OBB bounding box surrounding the basic geometric elements instead of the basic geometric elements characterized as a random sampling point collision detection method. The complex three-dimensional models of the collision problem are transformed into simple two-dimensional discrete space optimization problems, and improve the algorithm in real time.