TRIES: DATA STRUCTURES BASED ON BINARY REPRESENTATION FOR RAY TRACING

dc.contributor.author	Thirion, Jean-Philippe	en_US
dc.date.accessioned	2015-10-05T07:56:32Z
dc.date.available	2015-10-05T07:56:32Z
dc.date.issued	1990	en_US
dc.identifier.issn	1017-4656	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/egtp.19901043	en_US
dc.description.abstract	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.	en_US
dc.publisher	Eurographics Association	en_US
dc.title	TRIES: DATA STRUCTURES BASED ON BINARY REPRESENTATION FOR RAY TRACING	en_US
dc.description.seriesinformation	EG 1990-Technical Papers	en_US
dc.identifier.doi	10.2312/egtp.19901043	en_US