この商品を友人に教える:
Visibility Using Ray Tracing Algorithms and Data Structures: Investigating a Few Ray Tracing Algorithms and Data Structures in the Context of Visibility Ravi Kammaje
価格
¥ 11.235
税抜
遠隔倉庫からの取り寄せ
発送予定日 年10月27日 - 年11月6日
Ravi Kammaje の新しいリリースのお知らせを受け取る
iMusicのウィッシュリストに追加
Visibility Using Ray Tracing Algorithms and Data Structures: Investigating a Few Ray Tracing Algorithms and Data Structures in the Context of Visibility
Ravi Kammaje
Ray tracing is a popular rendering method with built in visibility determination. However, the computational costs are significant. To reduce them, there has been extensive research leading to innovative data structures and algorithms that optimally utilize both object and image coherence. Investigating these from a visibility determination context without considering further optical effects is the main motivation. Three methods ? one structure and two coherent tree traversal algorithms ? are discussed. While the structure, RBSP Tree, aims to increase coherence, the algorithms, Coherent Rendering and Row Tracing, aim to optimise utilization of coherence provided by ray tracing structures (kd-trees, octrees).
| メディア | 書籍 Paperback Book (ソフトカバーで背表紙を接着した本) |
| リリース済み | 2010年12月28日 |
| ISBN13 | 9783843382557 |
| 出版社 | LAP LAMBERT Academic Publishing |
| ページ数 | 220 |
| 寸法 | 226 × 13 × 150 mm · 346 g |
| 言語 | ドイツ語 |