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”

A Survey on Bounding Volume Hierarchies 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%2F21%3A00352512" target="_blank" >RIV/68407700:21230/21:00352512 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1111/cgf.142662" target="_blank" >https://doi.org/10.1111/cgf.142662</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1111/cgf.142662" target="_blank" >10.1111/cgf.142662</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Survey on Bounding Volume Hierarchies for Ray Tracing

  • Original language description

    Ray tracing is an inherent part of photorealistic image synthesis algorithms. The problem of ray tracing is to find the nearest intersection with a given ray and scene. Although this geometric operation is relatively simple, in practice, we have to evaluate billions of such operations as the scene consists of millions of primitives, and the image synthesis algorithms require a high number of samples to provide a plausible result. Thus, scene primitives are commonly arranged in spatial data structures to accelerate the search. In the last two decades, the bounding volume hierarchy (BVH) has become the de facto standard acceleration data structure for ray tracing-based rendering algorithms in offline and recently also in real-time applications. In this report, we review the basic principles of bounding volume hierarchies as well as advanced state of the art methods with a focus on the construction and traversal. Furthermore, we discuss industrial frameworks, specialized hardware architectures, other applications of bounding volume hierarchies, best practices, and related open problems.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA18-20374S" target="_blank" >GA18-20374S: Interactive Rendering with Distributed Illumination Computations</a><br>

  • Continuities

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

Others

  • Publication year

    2021

  • 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

  • Name of the periodical

    COMPUTER GRAPHICS FORUM

  • ISSN

    0167-7055

  • e-ISSN

    1467-8659

  • Volume of the periodical

    40

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    30

  • Pages from-to

    683-712

  • UT code for WoS article

    000657959600052

  • EID of the result in the Scopus database

    2-s2.0-85107382285