A Fast Ray Tracing Algorithm Using Space Indexing Techniques
| dc.contributor.author | Qunsheng, Peng | en_US |
| dc.contributor.author | Zhu, Yining | en_US |
| dc.contributor.author | Liang, Youdong | en_US |
| dc.date.accessioned | 2015-10-05T07:55:23Z | |
| dc.date.available | 2015-10-05T07:55:23Z | |
| dc.date.issued | 1987 | en_US |
| dc.description.abstract | A fast ray tracing algorithm is presented. Spatial coherency is exploited by adopting a linear octree data structure which corresponds to an adaptive partitioning of space. A ray strides over a number of empty regions aligning on its way and intersects the desired objects directly, Efficiency of the algorithm is achieved by decreasing the number of regions that the ray must be checked with, by reducing the computations involved in skipping an empty region and by performing a binary search to find the next region. An efficient algorithm based on linear programming for mapping the whole environment into a sorted linear octree is also described. Only the terminal nodes containing boundary surfaces of objects are explicitly represented, which not only shortens the searching process but also leads to a considerable saving on storage space. | en_US |
| dc.description.seriesinformation | EG-1987-Technical Papers | en_US |
| dc.identifier.doi | 10.2312/egtp.19871001 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egtp.19871001 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | A Fast Ray Tracing Algorithm Using Space Indexing Techniques | en_US |