Name
Abstract | ||
|---|---|---|
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently computes potentially visible geometry for volumetric viewing cells. We introduce novel extended projection operators, which permits efficient and conservative occlusion culling with respect to all viewpoints within a cell, and takes into account the combined occlusion effect of multiple occluders. We use extended projection of occluders onto a set of projection planes to create extended occlusion maps; we show how to efficiently test occludees against these occlusion maps to determine occlusion with respect to the entire cell. We also present an improved projection operator for certain specific but important configurations. An important advantage of our approach is that we can re-project extended projections onto a series of projection planes (via an occlusion sweep), and accumulate occlusion information from multiple blockers. This new approach allows the creation of effective occlusion maps for previously hard-to-treat scenes such as leaves of trees in a forest. Graphics hardware is used to accelerate both the extended projection and reprojection operations. We present a complete implementation demonstrating significant speedup with respect to view-frustum culling only, without the computational overhead of on-line occlusion culling. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1145/344779.344891 | SIGGRAPH |
Keywords | Field | DocType |
occlusion map,extended projection,conservative visibility,occlusion sweep,visibility determination,pvs,conservative occlusion,projection plane,extended occlusion map,combined occlusion effect,occlusion information,effective occlusion map,occlusion culling,projection operator,graphics hardware,projective plane | Overhead (computing),Computer vision,Potentially visible set,Visibility,Occlusion,Graphics hardware,Computer graphics (images),Computer science,Visualization,Projection (linear algebra),Artificial intelligence,Speedup | Conference |
ISSN | ISBN | Citations |
0097-8930 | 1-58113-208-5 | 69 |
PageRank | References | Authors |
2.93 | 31 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frédo Durand | 1 | 8625 | 414.94 |
| George Drettakis | 2 | 2281 | 147.82 |
| Joëlle Thollot | 3 | 745 | 37.34 |
| Claude Puech | 4 | 718 | 105.71 |