| Title: | On average-case complexity of ray tracing algorithms |
| Authors: | Márton, Gábor Szirmay-Kalos, László |
| Citation: | Journal of WSCG. 1995, vol. 3, no. 1-2, p. 187-196. |
| 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/16035 |
| ISSN: | 1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online) |
| Keywords: | sledování paprsku;akcelerační techniky;prostorová mřížka;teorie pravděpodobnosti |
| Keywords in different language: | ray tracing;acceleration techniques;spatial grid;probability theory |
| Abstract in different language: | A theoretical framework for analyzing average-case time and storage complexity of ray tracing acceleration techniques is introduced by means of homogeneous spatial Poisson point processes. Then, as a demonstrative example of its application, the expected query time of the widely known technique based on a regular spatial grid is analyzed. Finally, an interpretation of the results is presented within the context of probability theory. |
| Rights: | © Václav Skala - UNION Agency |
| Appears in Collections: | Volume 3, number 1-2 (1995) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Marton_95.pdf | Plný text | 1,26 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/16035Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.