A new K-DOPs collision detection algorithms improved by GA

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In collision detection algorithm based on bounding volume hierarchies, the update cost of the bounding volume hierarchies tree when the collision detection object motion or deformation directly influenced speed of collision detection. According to this trait, the update of bounding volume hierarchies was optimized by utilizing temporal-spatial coherence in virtual environment, to reduce the cost when the collision detection object motion or deformation that coused the update of the bounding volume hierarchies tree by using the genetic algorithm instead of traditional approximate method and improve the speed of collision detection greatly. The emulation experimental of the collision between cars show that this algorithm can solve the complexity and improve the property of the collision detection algorithm effectively. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Zhao, W., & Li, L. (2012). A new K-DOPs collision detection algorithms improved by GA. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 72 LNICST, pp. 58–68). https://doi.org/10.1007/978-3-642-29157-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free