| Title: | On convergence and complexity of radiosity algorithms |
| Authors: | Szirmay-Kalos, László Márton, Gábor |
| Citation: | Journal of WSCG. 1995, vol. 3, no. 1-2, p. 313-322. |
| Issue Date: | 1995 |
| Publisher: | Václav Skala - UNION Agency |
| Document type: | článek article |
| URI: | http://wscg.zcu.cz/wscg1995/wscg95.htm http://hdl.handle.net/11025/16052 |
| ISSN: | 1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online) |
| Keywords: | radiozita;vyhodnocení složitosti;randomizované algoritmy |
| Keywords in different language: | radiosity;complexity evaluation;randomized algorithms |
| Abstract in different language: | This paper evaluates and compares the convergence and complexity characteristics of radiosity algorithms with a special emphasis on randomized methods. |
| Rights: | © Václav Skala - UNION Agency |
| Appears in Collections: | Volume 3, number 1-2 (1995) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Szirmay_95.pdf | Plný text | 1,28 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/16052Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.