All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Efficient Stack-less BVH Traversal for Ray Tracing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00214813" target="_blank" >RIV/68407700:21230/13:00214813 - isvavai.cz</a>

  • Result on the web

    <a href="http://dl.acm.org/citation.cfm?id=2461219" target="_blank" >http://dl.acm.org/citation.cfm?id=2461219</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2461217.2461219" target="_blank" >10.1145/2461217.2461219</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Efficient Stack-less BVH Traversal for Ray Tracing

  • Original language description

    We propose a new, completely iterative traversal algorithm for ray tracing bounding volume hierarchies that is based on storing a parent pointer with each node, and on using simple state logic to infer which node to traverse next. Though our traversal algorithm does re-visit internal nodes, it intersects each visited node only once, and in general performs exactly the same ray-box tests and ray-primitive intersection tests---and in exactly the same order---as a traditional stack-based variant. The proposed algorithm can be used for computer architectures that need to minimize the use of local memory for processing rays or those that need to minimize the data transport such as distributed multi-CPU architectures.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F11%2F1883" target="_blank" >GAP202/11/1883: Global Illumination for Augmented Reality in General Environments</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2013

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the 27th Spring Conference on Computer Graphics

  • ISBN

    978-1-4503-1978-2

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    7-12

  • Publisher name

    ACM

  • Place of publication

    New York

  • Event location

    Viničné

  • Event date

    Apr 28, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article