Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/91576| Title: | Parallel construction and update of acceleration structures for ray tracing |
| Authors: | Napoli, Kevin (2013) |
| Keywords: | Computer graphics Computer science Ray tracing algorithms |
| Issue Date: | 2013 |
| Citation: | Napoli, K. (2013). Parallel construction and update of acceleration structures for ray tracing (Bachelor's dissertation). |
| Abstract: | Image synthesis is the process of generating an image from a representation of a virtual scene. Ray tracing is used in a number of image synthesis techniques in order to determine the visibility of geometric primitives from the point of view of an observer, and requires considerable amounts of computational resources. Specific data structures are meant to accelerate this process by taking advantage of the spatial coherence of objects within a scene. In the case of scenes which do not exhibit change, acceleration structures are constructed once and used throughout. However, with deformable objects, these data structures can become invalid over time. In this work we have explored ways of constructing and updating acceleration data structures of scenes which exhibit change, by taking advantage of multiple processing elements and a shared memory architecture. We have introduced a novel acceleration data structure which we term the dual-acceleration structure and two metrics for evaluating the degradation of specific acceleration structures over time. Results show that our method performs better than the straightforward approach, especially on large datasets. |
| Description: | B.SC.(HONS)COMP.SCI. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/91576 |
| Appears in Collections: | Dissertations - FacICT - 2013 Dissertations - FacICTCS - 2010-2015 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| B.SC.(HONS)ICT_Napoli_Kevin_2013.PDF Restricted Access | 8.41 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
