SIMD Optimized Bounding Volume Hierarchies for Fast Proximity Queries

Examensarbete för masterexamen

Please use this identifier to cite or link to this item:
Download file(s):
File Description SizeFormat 
193595.pdfFulltext1.5 MBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYtterlid, Robin
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.description.abstract3D models of physical objects are used in an ever-growing number of areas to help visualize and simulate digital environments. Applications must often simulate complex processes involving physical phenomena such as forces, velocities and physical interactions between objects. In such environments, it is crucial to be able to e ectively determine proximity between objects by using collision- and distance tests. As the number and complexity of 3D models increases, together with an increasing demand for simulation precision and realism, heavy demands are placed on the performance of the proximity tests that are used. This thesis investigates the possibilities of increasing proximity test performance by combining Bounding Volume Hierarchies, which are common data structures for accelerating proximity tests, with a certain method for parallel computation called SIMD. Some SIMD-based construction strategies are presented and shown to increase proximity test speed by up to 50% and reducing BVH memory footprint by up 60%.
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleSIMD Optimized Bounding Volume Hierarchies for Fast Proximity Queries
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
Collection:Examensarbeten för masterexamen // Master Theses

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.