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”

Parallel On-Demand Hierarchy Construction on Contemporary GPUs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00233088" target="_blank" >RIV/68407700:21230/15:00233088 - isvavai.cz</a>

  • Result on the web

    <a href="http://doi.ieeecomputersociety.org/10.1109/TVCG.2015.2465898" target="_blank" >http://doi.ieeecomputersociety.org/10.1109/TVCG.2015.2465898</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TVCG.2015.2465898" target="_blank" >10.1109/TVCG.2015.2465898</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallel On-Demand Hierarchy Construction on Contemporary GPUs

  • Original language description

    We present the first parallel on-demand spatial hierarchy construction algorithm targeting ray tracing on many-core processors such as GPUs. The method performs simultaneous ray traversal and spatial hierarchy construction focused on the parts of the data structure being traversed. The method is based on a versatile framework built around a task pool and runs entirely on the GPU. We show that the on-demand construction can improve rendering times compared to full hierarchy construction. We evaluate ourmethod on both object (BVH) and space (kd-tree) subdivision data structures and compare them mutually. The on-demand method is particularly beneficial for rendering large scenes with high occlusion. We also present SAH kd-tree builder that outperforms previous state-of-the-art builders running on the GPU.

  • Czech name

  • Czech description

Classification

  • Type

    O - Miscellaneous

  • 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ů