Název: | Improving the Hierarachical Stochastic Radiosity Algorithm |
Autoři: | Pope, Jackson Chalmers, Alan |
Citace zdrojového dokumentu: | WSCG '2000: Conference proceeding: The 8th International Conference in Central Europe on Computers Graphics, Visualization and Interaktive Digital Media '2000 in cooperation with EUROGRAPHICS and IFIP WG 5.10: University of West Bohemia, Plzen, Czech republic, February 7 - 10, 2000, p. 244-251. |
Datum vydání: | 2000 |
Nakladatel: | University of West Bohemia |
Typ dokumentu: | konferenční příspěvek conferenceObject |
URI: | http://wscg.zcu.cz/wscg2000/Papers_2000/R31.pdf.gz http://hdl.handle.net/11025/15462 |
ISBN: | 80-7082-612-6 |
Klíčová slova: | počítačová grafika;hierarchické dělení;ardiozita;Monte Carlo |
Klíčová slova v dalším jazyce: | computer graphics;hierarchical subdivision;radiosity;Monte Carlo |
Abstrakt: | Hierarchical subdivision techniques remove the need for a-priori meshing of surfaces when approximating global illumination. In addition they allow progressive refinement which generates better solutions quickly. However, when subdivision is based upon Monte Carlo methods, due to the stochastic nature of such techniques, conclusions cannot be drawn unless a sufficiently large number of samples have been considered. Shadow boundaries are one of the main features such subdivision algorithms are designed to detect, but mesh elements that are in shadow receive less light, and hence are slower to subdivide. In this paper we consider and evaluate methods for modifying the Monte Carlo hierarchical subdivision algorithm to improve the detection of shadow boundaries and caustics. |
Práva: | © University of West Bohemia |
Vyskytuje se v kolekcích: | WSCG '2000: Conference proceeding |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Pope.pdf | Plný text | 159,57 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/15462
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.