Parallel Collision Detection
来源:互联网 发布:php 数组 push 与pop 编辑:程序博客网 时间:2024/05/18 09:13
貌似如果有人搜索相关词汇是能够搜索到我的blog的,特别留下此文以防止有哥们走我同样的弯路了...
顺便放一个英文东西:
来自于:http://parallel.vub.ac.be/documentation/pvm/Example/Marc_Ramaekers/node3.html
Sweep and Prune
Given a number N of objects, O(N2) object pairs have to be checked for collision. In general, the objects in most of the pairs aren't even close to each other so we should be able to eliminate them quickly. To do this we use a technique called Sweep and Prune ([CLMP95]). In this section I will briefly introduce this technique.
To determine whether two objects are close enough to potentially collide, the Sweep and Prune checks whether the axis aligned bounding boxes of the respective objects overlap. If they do, further investigation is necessary. If not, the objects can't possibly collide and the algorithm can move on. To determine whether two bounding boxes overlap, the algorithm reduces the 3D problem to three simpler 1D problems. It does so by determining the intervals occupied by the bounding volume along each of thex,y and z axes. If and only if the intervals of two bounding volumes overlap in all of the three dimensions, the objects corresponding to these bounding volumes must overlap. To determine which intervals of the objects along an axis overlap, the list of the intervals is sorted. Normally, using quick-sort, this would be an process. However, by exploiting frame coherence (the similarity between situations in two subsequent frames) we can sort the lists in an expected (O(N), using insertion sort.
Another difficult part in the Sweep and Prune approach is the maintenance of the bounding volume. If the objects in the scene move or rotate, the previously calculated bounding boxes are invalid. It is important to be able to update the boxes as quickly as possible. Again, we can do this by exploiting frame coherence.
The algorithm's performance is of course dependent on the application and the typical situations that occur in that application. Many variations exists, such as reducing the overlap problem by only 1 dimension and using a rectangle intersection test. It is also possible to choose other types of bounding volumes that might be faster to update but produce a less accurate approximation of the object.
- Collision Detection - Parallel Computing
- Parallel Collision Detection
- collision detection
- AoC Collision detection & Sounds
- AoC Collision detection & Sounds
- Advanced Collision Detection Techniques
- Scene Management --- Collision Detection
- Collision Detection Overview
- Collision Detection Tutorial
- ACM Collision detection
- Sicily 1907. Collision Detection
- HDU 2436 - Collision Detection
- Real Time Collision Detection
- Collision Detection Model, google code project
- Bullet Narrow Phase Collision Detection 流程图
- hdu 2436 Collision Detection(数学问题)
- Pixel Perfect Collision Detection (Using Cocos2d-x)
- 【计算几何】 HDOJ 2436 Collision Detection
- PHP pathinfo() 函数
- 分布式哈希和一致性哈希的概念与算法实现
- Object对象的方法和属性
- MFC:CImage显示OpenCV:Mat矩阵图像
- WEB框架所要解决的问题
- Parallel Collision Detection
- 变成百万富翁的二十五种方法
- 创建ActionForm
- 计算机科学中的一些基本原理和定理
- 新账号开博了,希望有志同道合的朋友来捧场,呵呵。
- Iphone 之Timer
- 杭电hdu 1846 Brave Game 巴什博奕
- 想求同类别的本条记录的in_date_time-上条记录的out_date_time
- Android2.3 修改默认时区