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 |
id |
ndltd-UPSALLA1-oai-DiVA.org-uu-129453 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UPSALLA1-oai-DiVA.org-uu-1294532013-01-08T13:49:21ZReal-time Collision Detection with Implicit ObjectsengOlvång, LeifUppsala universitet, Institutionen för informationsteknologi2010Collision 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. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-129453IT ; 10 009application/pdfinfo:eu-repo/semantics/openAccess |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
description |
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. |
author |
Olvång, Leif |
spellingShingle |
Olvång, Leif Real-time Collision Detection with Implicit Objects |
author_facet |
Olvång, Leif |
author_sort |
Olvång, Leif |
title |
Real-time Collision Detection with Implicit Objects |
title_short |
Real-time Collision Detection with Implicit Objects |
title_full |
Real-time Collision Detection with Implicit Objects |
title_fullStr |
Real-time Collision Detection with Implicit Objects |
title_full_unstemmed |
Real-time Collision Detection with Implicit Objects |
title_sort |
real-time collision detection with implicit objects |
publisher |
Uppsala universitet, Institutionen för informationsteknologi |
publishDate |
2010 |
url |
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-129453 |
work_keys_str_mv |
AT olvangleif realtimecollisiondetectionwithimplicitobjects |
_version_ |
1716530056285650944 |