Fast Rendering of Complex Dynamic Scenes

Simple item page
dc.contributor.authorKovalcĂ­k, Viten_US
dc.contributor.authorSochor, Jirien_US
dc.contributor.editorLouise M. Lever and Mary McDerbyen_US
dc.date.accessioned2014-01-31T19:53:33Z
dc.date.available2014-01-31T19:53:33Z
dc.date.issued2006en_US
dc.description.abstractWe present a novel algorithm capable of rendering complex dynamic scenes at high frame rates. The key part of the algorithm is occlusion culling which is performed by an optimized usage of the hardware occlusion queries. The spatial organization of the scene using 2-level BSP-like hierarchy helps to speed up evaluating full and partial occlusion of the objects. The algorithm handles both static and dynamic objects and places no restrictions on the shape of objects.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphics 2006en_US
dc.identifier.isbn3-905673-59-2en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/TPCG/TPCG06/081-087en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realismen_US
dc.titleFast Rendering of Complex Dynamic Scenesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
081-087.pdf
Size:
156.61 KB
Format:
Adobe Portable Document Format
Download
Collections
EG UK Theory and Practice of Computer Graphics 2006