About: When it is More Efficient to Use Uniform Grids for Ray Tracing     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
Description
  • Commonly used hierarchical data structures such as bounding volume hierarchies and kdtrees have rather high build times, which can be a bottleneck for applications rebuilding or updating the acceleration structure required by data changes. On the other hand uniform grids can be built almost instantly in linear time, however, they can suffer from severe performance penalty, in particular in scenes with non uniformly populated geometry. We improve on performance using a two-step approach that selects a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time.
  • Commonly used hierarchical data structures such as bounding volume hierarchies and kdtrees have rather high build times, which can be a bottleneck for applications rebuilding or updating the acceleration structure required by data changes. On the other hand uniform grids can be built almost instantly in linear time, however, they can suffer from severe performance penalty, in particular in scenes with non uniformly populated geometry. We improve on performance using a two-step approach that selects a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time. (en)
Title
  • When it is More Efficient to Use Uniform Grids for Ray Tracing
  • When it is More Efficient to Use Uniform Grids for Ray Tracing (en)
skos:prefLabel
  • When it is More Efficient to Use Uniform Grids for Ray Tracing
  • When it is More Efficient to Use Uniform Grids for Ray Tracing (en)
skos:notation
  • RIV/68407700:21230/11:00180561!RIV13-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP202/11/1883), P(MEB060906), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 241728
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/11:00180561
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Ray tracing; uniform grids; hierarchical data structure (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [5322AF27F8D4]
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hapala, Michal
  • Havran, Vlastimil
  • Karlík, Ondřej
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software