ANALYSIS OF AN ALGORITHM FOR FAST RAY TRACING USING UNIFORM SPACE SUBDIVISION
dc.contributor.author | Cleary, John G. | eng |
dc.contributor.author | Wyvill, Geoff | eng |
dc.date.accessioned | 2008-02-27T16:57:07Z | |
dc.date.available | 2008-02-27T16:57:07Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1987-10-01 | eng |
dc.description.abstract | Ray tracing is becoming popular as the best method of rendering high quality images from three dimensional models. Unfortunately, the computational cost is high. Recently, a number of authors have reported on ways to speed up this process by means of space subdivision which is used to minimize the number of intersection calculations. We describe such an algorithm together with an analysis of the factors which affect its performance. The critical operation of skipping an empty space subdivision can be done very quickly, using only integer addition and comparison. A theoretical analysis of the algorithm is developed. It shows how the space and time requirements vary with the number of objects in the scene. | 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 | 1987-282-30 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30530 | |
dc.identifier.uri | http://hdl.handle.net/1880/45828 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | ANALYSIS OF AN ALGORITHM FOR FAST RAY TRACING USING UNIFORM SPACE SUBDIVISION | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |