TRIES: DATA STRUCTURES BASED ON BINARY REPRESENTATION FOR RAY TRACING
View/
Date
1990Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
Tries are data structures used for multidimensional searching. We introduce an original method to build Tries for a set of convex polyhedra, weshow how Tries can be used for Ray tracing and we compare them with other data structures. Their advantages are mainly compactness of memory representation and fast building of the structure due to simple binary operations. Tries also accelerate the Ray tracing process compared to other octree-like structures. Furthermore, they are easy to implement because they are a unified approach to multidimensional problems. Finally we show experimental results to compare them with other data structures used for image synthesis.
BibTeX
@inproceedings {egtp.19901043,
booktitle = {EG 1990-Technical Papers},
editor = {},
title = {{TRIES: DATA STRUCTURES BASED ON BINARY REPRESENTATION FOR RAY TRACING}},
author = {Thirion, Jean-Philippe},
year = {1990},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egtp.19901043}
}
booktitle = {EG 1990-Technical Papers},
editor = {},
title = {{TRIES: DATA STRUCTURES BASED ON BINARY REPRESENTATION FOR RAY TRACING}},
author = {Thirion, Jean-Philippe},
year = {1990},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egtp.19901043}
}