RAY TRACING SCENES OF VARYING LOCAL COMPLEXITY
dc.contributor.author | Jevans, David A.J. | eng |
dc.date.accessioned | 2008-05-20T23:28:08Z | |
dc.date.available | 2008-05-20T23:28:08Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1990-01-01 | eng |
dc.description.abstract | An adaptive algorithm for ray tracing scenes of varying local complexity is presented. Scenes are subdivided by an hierarchial 1D grid structure, and a fast transversal algorithm is used to trace rays through the scene. A cost function is used to determine the subdivision granularity at each level. Results illustrating the relative performance of this algorithm, the octree approach, uniform space subdivision, and adaptive 3D grid subdivision are presented. | 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 | 1990-378-02 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31349 | |
dc.identifier.uri | http://hdl.handle.net/1880/46512 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | RAY TRACING SCENES OF VARYING LOCAL COMPLEXITY | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |