Discrete Ray-Tracing of Huge Voxel Spaces
| dc.contributor.author | Stolte, Nilo | en_US |
| dc.contributor.author | Caubet, Rene | en_US |
| dc.date.accessioned | 2014-10-21T07:37:52Z | |
| dc.date.available | 2014-10-21T07:37:52Z | |
| dc.date.issued | 1995 | en_US |
| dc.description.abstract | The quality of images produced by Discrete Ray-Tracing voxel spaces is highly dependent on 3d grid resolution. The huge amount of memory needed to store such grids often discards discrete Ray-Tracing as a practical visualization algorithm. The use of an octree can drastically change this when most of space is empty, as such is the case in most scenes.Although the memory problem can be bypassed using the octree, the performance problem still remains. A known fact is that the performance of discrete traversal is optimal for quite low resolutions. This problem can be easily solved by dividing the task in two steps, working in two low resolutions instead of just one high resolution, thus taking advantage of optimal times in both steps. This is possible thanks to the octree property of representing the same scene in several different resolutions. This article presents a two step Discrete Ray-Tracing method using an octree and shows, by comparing it with the single step version, that a substantial gain in performance is achieved. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 14 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.1995.cgf143-0383.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 383-394 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.1995.cgf143-0383.x | en_US |
| dc.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
| dc.title | Discrete Ray-Tracing of Huge Voxel Spaces | en_US |