Název: An efficient parametric algorithm for octree traversal
Autoři: Revelles, J.
Urena, C.
Lastra, M.
Citace zdrojového dokumentu: Journal of WSCG. 2000, vol. 8, no. 1-3.
Datum vydání: 2000
Nakladatel: Václav Skala - UNION Agency
Typ dokumentu: article
článek
URI: http://hdl.handle.net/11025/15821
http://wscg.zcu.cz/wscg2000/wscg_2000_program.htm
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Klíčová slova: Octree;binární strom;sledování paprsku;akcelerační techniky
Klíčová slova v dalším jazyce: Octree;binary tree;ray tracing;acceleration techniques
Abstrakt v dalším jazyce: An octree is a well known hierarchical spatial structure which is widely used in Computer Graphics algorithms. One of the most frequent operations is the computation of the octree voxels intersected by a straight line. This has a number of applications, such as ray-object intersection tests speed-up and visualisation of hierarchical density models by ray-casting. Several methods have been proposed to achieve this goal, which differ in the order in which intersected voxels are visited. In this paper we introduce a new top-down parametric method. The main difference with previously proposed methods is related to descent movements, that is, the selection of a child sub-voxel from the current one. This selection, as the algorithm, is based on the parameter of the ray and comprises simple comparisons. The resulting algorithm is easy to implement, and efficient when compared to other related top-down and bottom-up algorithms for octrees. Finally, a comparison with Kelvin’s method for binary trees is presented.
Práva: © Václav Skala - UNION Agency
Vyskytuje se v kolekcích:Volume 8, number 1-3 (2000)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
X31.pdfPlný text327,19 kBAdobe PDFZobrazit/otevřít


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/15821

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.