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”

Incremental BVH construction 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%2F15%3A00225053" target="_blank" >RIV/68407700:21230/15:00225053 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0097849314001435" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0097849314001435</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.cag.2014.12.001" target="_blank" >10.1016/j.cag.2014.12.001</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Incremental BVH construction for ray tracing

  • Original language description

    We propose a new method for incremental construction of Bounding Volume Hierarchies (BVH). Despite the wide belief that the incremental construction of BVH is inefficient we show that our method incrementally constructs a BVH with quality comparable to the best SAH builders. We illustrate the versatility of the proposed method using a flexible parallelization scheme that opens new possibilities for combining different BVH construction heuristics. We demonstrate the usage of the method in a proof-of-concept application for real-time preview of data streamed over the network. We believe that our method will renew the interest in incremental BVH construction and it will find its applications in ray tracing based remote visualizations and fast previews orin interactive scene editing applications handling very large data sets.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F12%2F2413" target="_blank" >GAP202/12/2413: Optimal Algorithms for Image Synthesis</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2015

  • 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

    Computers & Graphics

  • ISSN

    0097-8493

  • e-ISSN

  • Volume of the periodical

    47

  • Issue of the periodical within the volume

    April

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    10

  • Pages from-to

    135-144

  • UT code for WoS article

    000351785600013

  • EID of the result in the Scopus database

    2-s2.0-84922582739