ADAPTIVE VOXEL SUBDIVISION FOR RAY TRACING
| dc.contributor.author | Jevans, David | eng |
| dc.contributor.author | Wyvill, Brian | eng |
| dc.date.accessioned | 2008-02-27T22:46:52Z | |
| dc.date.available | 2008-02-27T22:46:52Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1988-11-01 | eng |
| dc.description.abstract | Although regular subdivision has been shown to be efficient at ray tracing scenes where objects are evenly distributed, such algorithms perform poorly when objects are concentrated in a small number of voxels. In this paper, a method is presented where voxels in a regular grid are examined and recursively subdivided depending on object density. This integration of regular and adaptive spatial subdivision methods allows images consisting of large regularly distributed objects and small dense objects to be ray traced efficiently. The parameters controlling the coarseness of the voxel grid, depth of adaptive subdivision trees, and maximum number of polygons per voxel are varied and their effects on execution time, subdivision time, and memory use are measured. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1988-332-44 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31213 | |
| dc.identifier.uri | http://hdl.handle.net/1880/46243 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | ADAPTIVE VOXEL SUBDIVISION FOR RAY TRACING | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |