Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Schmidt, Martin | |
dc.contributor.author | Lobachev, Oleg | |
dc.contributor.author | Guthe, Michael | |
dc.contributor.editor | Skala, Václav | |
dc.date.accessioned | 2016-07-25T08:47:28Z | |
dc.date.available | 2016-07-25T08:47:28Z | |
dc.date.issued | 2016 | |
dc.identifier.citation | Journal of WSCG. 2016, vol. 24, no. 1, p. 1-8. | en |
dc.identifier.issn | 1213-6972 (print) | |
dc.identifier.issn | 1213-6980 (CD-ROM) | |
dc.identifier.issn | 1213-6964 (on-line) | |
dc.identifier.uri | http://wscg.zcu.cz/WSCG2016/!_2016_Journal_WSCG-No-1.pdf | |
dc.identifier.uri | http://hdl.handle.net/11025/21640 | |
dc.format | 8 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Václav Skala - UNION Agency | cs |
dc.relation.ispartofseries | Journal of WSCG | en |
dc.rights | © Václav Skala - UNION Agency | cs |
dc.subject | globální osvětlení | cs |
dc.subject | paralelní algoritmus | cs |
dc.subject | Markovův řetězec | cs |
dc.subject | Monte Carlo | cs |
dc.title | Coherent metropolis light transport on the GPU using speculative mutations | en |
dc.type | článek | cs |
dc.type | article | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.description.abstract-translated | The Metropolis Light Transport algorithm generates physically based images with superior image quality than classical ray tracing. Although it is trivially parallelizable on GPUs by running N MLTs, the performance on current graphics hardware is below par. One of the main problems is the set of incoherent paths due to the independent Markov chains. Since each MLT generates full paths and mutates them sequentially, we construct totally incoherent rays which in negatively affects the performance on the GPU. By using a novel speculative variant of the Metropolis algorithm we increase the similarity of paths and achieve higher coherence. This decreases the computation time significantly. Further, we improve memory access by optimizing the data layout to better utilize coalesced access. | en |
dc.subject.translated | global illumination | en |
dc.subject.translated | parallel algorithm | en |
dc.subject.translated | Markov chain | en |
dc.subject.translated | Monte Carlo | en |
dc.type.status | Peer-reviewed | en |
Vyskytuje se v kolekcích: | Volume 24, Number 1 (2016) |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Schmidt.pdf | Plný text | 7,45 MB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/21640
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.