Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorKeul, Kevin
dc.contributor.authorKoß, Tilman
dc.contributor.authorMüller, Stefan
dc.contributor.editorSkala, Václav
dc.date.accessioned2019-05-07T06:24:37Z-
dc.date.available2019-05-07T06:24:37Z-
dc.date.issued2018
dc.identifier.citationJournal of WSCG. 2018, vol. 26, no. 1, p. 11-20.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (on-line)
dc.identifier.uriwscg.zcu.cz/WSCG2018/!_2018_Journal_WSCG-No-1.pdf
dc.identifier.urihttp://hdl.handle.net/11025/34584
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectvizualizacecs
dc.subjectpočítačová grafikacs
dc.subjecttrasování paprskucs
dc.subjectdatové strukturycs
dc.subjectalgoritmy viditelnostics
dc.titleFast indirect lighting approximations using the representative candidate line spaceen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedWe propose a novel approach for using directional Line Space information in calculation of indirect illumination. Typically, the Line Space is build on top of regular recursive grids and contains visibility information which is used to perform an efficient empty space skipping during traversal. In our method we extend the stored information by precomputed representative candidates, which are based on the Line Space shafts and serve as an approximation of the actual scene geometry. By using these candidates it is not necessary to compute any intersection tests and therefore the traversal is accelerated. However, the candidate approximation leads to visible artifacts. We therefore present a technique that significantly reduces these artifacts by extrapolation of the actual surface and demonstrate that the artifacts are nearly not perceivable in the application of indirect illumination. Moreover we adapt the Line Space to other data structures like bounding volume hierarchies (BVHs) which further increases the performance in ray tracing. Compared to the pure data structures we achieve significantly better performance with nearly no drawback in quality of indirect lighting.en
dc.subject.translatedvisualizationen
dc.subject.translatedcomputer graphicsen
dc.subject.translatedray tracingen
dc.subject.translateddata structuresen
dc.subject.translatedvisibility algorithmsen
dc.identifier.doihttps://doi.org/10.24132/JWSCG.2018.26.1.2
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 26, Number 1 (2018)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Keul.pdfPlný text9,05 MBAdobe PDFZobrazit/otevřít


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/34584

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.