Abstract
The Hierarchical Occlusion Map algorithm is combined with Frustum Slicing to give a simpler occlusion-culling algorithm that more adequately caters to large, open VEs. The algorithm adapts to the level of visual congestion and is well suited for use with large, complex models with long mean free line of sight ('the great outdoors'), models for which it is not feasible to construct, or search, a database of occluders to be rendered each frame.
| Original language | English |
|---|---|
| Title of host publication | ACM Virtual Reality 2000 Proceedings |
| Number of pages | 290 |
| Publication date | 2000 |
| Publication status | Published - 2000 |
| Event | ACM Virtual Reality 2000 Conference - Washington , United States Duration: 18 Mar 2000 → 22 Mar 2000 |
Conference
| Conference | ACM Virtual Reality 2000 Conference |
|---|---|
| Country/Territory | United States |
| City | Washington |
| Period | 18/03/2000 → 22/03/2000 |