TRIES: DATA STRUCTURES BASED ON BINARY REPRESENTATION FOR RAY TRACING

Simple item page
dc.contributor.authorThirion, Jean-Philippeen_US
dc.date.accessioned2015-10-05T07:56:32Z
dc.date.available2015-10-05T07:56:32Z
dc.date.issued1990en_US
dc.description.abstractTries 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.en_US
dc.description.seriesinformationEG 1990-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19901043en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19901043en_US
dc.publisherEurographics Associationen_US
dc.titleTRIES: DATA STRUCTURES BASED ON BINARY REPRESENTATION FOR RAY TRACINGen_US
Files
Collections
EG1990 Proceedings (Technical Papers)
EG1990 Proceedings (Technical Papers)