DocumentCode
1903520
Title
Fast Collision Detection of Space-Time Correlation
Author
Huiyan, Qu ; Wei, Zhao
Author_Institution
Sch. of Inf. Technol., Jilin Agric. Univ., Changchun, China
Volume
3
fYear
2012
fDate
23-25 March 2012
Firstpage
567
Lastpage
571
Abstract
To improve real-time performance and accuracy are key aspects of collision detection. In view of that conventional algorithms of collision detection spend a lot of detection time, this paper presents a advanced algorithm. We adapts a parallel method based on MPI. At the same time, we use temporal-spatial coherence and spatial subdivision algorithm. First, we subdivide the space into a series of voxels, and then we detect the state of the object. If the state is changed, we should build its list which is used to store its adjacent objects in voxel. We can begin with mark points. These mark points has independence, so the parallel method based on MPI can be used to speed up the collision detection. In a word, this algorithm reduces the times of collision detection and the traversing depth of the bounding box tree. The results of experiment prove that this method has real-time performance and superiority.
Keywords
application program interfaces; message passing; parallel algorithms; spatiotemporal phenomena; trees (mathematics); virtual reality; MPI; bounding box tree; fast collision detection; mark points; parallel method; space-time correlation; spatial subdivision algorithm; temporal-spatial coherence; traversing depth; Algorithm design and analysis; Correlation; Detection algorithms; Educational institutions; Object recognition; Parallel processing; Peer to peer computing; collision detection; list; parallel; spatial subdivision; temporal-spatial coherence;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on
Conference_Location
Hangzhou
Print_ISBN
978-1-4673-0689-8
Type
conf
DOI
10.1109/ICCSEE.2012.231
Filename
6188238
Link To Document