Name
Abstract | ||
|---|---|---|
This paper presents an effective algorithm for occlusion culling using hardware occlusion queries. The number of queries is optimized according to the results of the queries from several preceding frames. Parts of the scene which are found to be unoccluded in recent frames, are tested less often thus reducing the number of queries performed per frame. The algorithm is applicable to any kind of scene, including scenes with moving objects. The algorithm utilizes a tree structure containing objects in the scene. |
Year | Venue | Keywords |
|---|---|---|
2005 | WSCG (Short Papers) | tree structure,occlusion culling |
Field | DocType | Citations |
Potentially visible set,Computer vision,Visibility,Occlusion,Real-time rendering,Computer science,Tree structure,Artificial intelligence,Occlusion culling | Conference | 5 |
PageRank | References | Authors |
0.56 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vit Kovalcik | 1 | 6 | 1.60 |
| Jiri Sochor | 2 | 119 | 11.85 |