Efficient Sorting and Searching in Rendering Algorithms

Simple item page
dc.contributor.authorHavran, Vlastimilen_US
dc.contributor.authorBittner, Jirien_US
dc.contributor.editorNadia Magnenat-Thalmann and Katja Bühleren_US
dc.date.accessioned2015-07-19T17:06:44Z
dc.date.available2015-07-19T17:06:44Z
dc.date.issued2006en_US
dc.description.abstractIn the proposed tutorial we would like to highlight the connection between rendering algorithms and sorting and searching as classical problems studied in computer science. We will provide both theoretical and empirical evidence that for many rendering techniques most time is spent by sorting and searching. In particular we will discuss problems and solutions for visibility computation, density estimation, and importance sampling. For each problem we mention its specific issues such as dimensionality of the search domain or online versus offline searching. We will present the underlying data structures and their enhancements in the context of specific rendering algorithms such as ray shooting, photon mapping, and hidden surface removal.en_US
dc.description.sectionheadersen_US
dc.description.seriesinformationEurographics 2006: Tutorialsen_US
dc.identifier.doi10.2312/egt.20061061en_US
dc.identifier.pages325-398en_US
dc.identifier.urihttps://doi.org/10.2312/egt.20061061en_US
dc.publisherThe Eurographics Associationen_US
dc.titleEfficient Sorting and Searching in Rendering Algorithmsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0325-0398.pdf
Size:
3.56 MB
Format:
Adobe Portable Document Format
Download
Collections
Tutorials 2006