Detailed and exact collision detection for large amounts of objects has for a long time been a non real-time affair because of the immense amount of computations necessary. This was however not only because of the complexity of the algorithms but also because discussed of the computations would not have had to be done in the first place. This paper has through literature research and empirical testing examined two different broad phase approaches to object culling in a three dimensional environment. The aim of such a broad phase algorithm is to decrease the amount of computation heavy narrow phase collision detection checks and thus enhancing application performance. Potential weaknesses of these approaches were addressed and possible solutions discussed. Performance comparisons were made to give a better overview of what kind of performance enhancements can be expected and to give a theoretical base for further research.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:hig-9591 |
| Date | January 2011 |
| Creators | Liljeby, Jonas |
| Publisher | Högskolan i Gävle, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0022 seconds