| Title: | On scene complexity definition for rendering |
| Authors: | Niepel, Ludovít Martinka, Jozef Ferko, Andrej Eliass, Pavol |
| Citation: | Journal of WSCG. 1995, vol. 3, no. 1-2, p. 209-217. |
| 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/16040 |
| ISSN: | 1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online) |
| Keywords: | vykreslování;polygonální scéna;algoritmy |
| Keywords in different language: | rendering;polygonal scene;algorithms |
| Abstract in different language: | This paper introduces one way how to define in a mathematically correct way the complexity of the polygonal scene for rendering. This complexity allows to compare previously incomparable rendering algorithms via computing the complexity of various scenes, and give the more rigid solution of other related problems. The advantages of this unified approach are discussed. |
| Rights: | © Václav Skala - UNION Agency |
| Appears in Collections: | Volume 3, number 1-2 (1995) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Niepel_95.pdf | Plný text | 1,16 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/16040Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.