Real-time Collision Detection with Implicit Objects
Collision detection is a problem that has been studied in many different contexts. Lately one of the most common context has been rigid multi-body physics for different types of simulations. A popular base algorithm in this context is Gilbert-Johnson-Keerthi's algorithm for measuring the distan...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2010
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-129453 |
| Summary: | Collision detection is a problem that has been studied in many different contexts. Lately one of the most common context has been rigid multi-body physics for different types of simulations. A popular base algorithm in this context is Gilbert-Johnson-Keerthi's algorithm for measuring the distance between two convex objects. This algorithm belongs to a family of algorithms which share the common property of allowing implicitly defined objects. In this thesis we give a theoretical overview of the algorithms in this family and discuss things to keep in mind when implementing them. We also give a presentation of how they behave in different situations based on our experiments. Finally we give recommendations for in which general cases one should use which algorithm. |
|---|