Stackless Ray Traversal for kD-Trees with Sparse Boxes

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03138105" target="_blank" >RIV/68407700:21230/07:03138105 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Stackless Ray Traversal for kD-Trees with Sparse Boxes

Original language description

We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towardsimplementation of the method on the architectures with limited number of registers.

Czech name

Stackless Ray Traversal for kD-Trees with Sparse Boxes

Czech description

We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towardsimplementation of the method on the architectures with limited number of registers.

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

CH - Nuclear and quantum chemistry, photo chemistry

OECD FORD branch

—

Project

<a href="/en/project/LC06008" target="_blank" >LC06008: Center of Computer Graphics</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2007

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computer Graphics & Geometry

ISSN

1811-8992

e-ISSN

—

Volume of the periodical

9

Issue of the periodical within the volume

3

Country of publishing house

RU - RUSSIAN FEDERATION

Number of pages

1514

Pages from-to

16-30

UT code for WoS article

—

EID of the result in the Scopus database

—