Collision Detection.pdf

More documents

Recommendations

Info

Dynamic CD using BSP Trees e = n⋅ ( t − p ) o 2003-12 12-1717 14
Dynamic CD using BSP Trees • Pseudo code Pseudo code for finding the impact poin by traversing BSP tree. Check if empty or not in the BSP tree Shifting the dividing plane of BSP tree to find correct impact point. Potential inaccuracy and beveling 2003-12 12-1717 15
Page 1 and 2: Collision Detection Pu Jiantao. 200
Page 3 and 4: Introduction • Collision Collisio
Page 5 and 6: Introduction • Good CD Algorithms
Page 7 and 8: Introduction • If the scenario co
Page 9 and 10: Multi-phase detection strategy •
Page 11 and 12: Rays Method • Approximate an obje
Page 13: Dynamic CD using BSP Trees • A sp
Page 17 and 18: • Features. Hierarchical Method
Page 19 and 20: Hierarchical Method • Evaluating
Page 21 and 22: • Why OBBTree? OBBTree Method OBB
Page 23 and 24: OBBTree Method • Hierarchical Bui
Page 25 and 26: Some Other Topics • Time-Critical
Page 27 and 28: Some Other Topics • Distance Quer
Page 29 and 30: Some Other Topics • Collision Res

Collision Detection.pdf

Create successful ePaper yourself

Delete template?

Save as template?