ACM Transactions on Graphics · 2003 · 34 citations · 21 references
ComputingComputer ScienceComputational GeometryComputer VisionRenderingGeometry ProcessingMulti-view GeometryVisibility ComputationConservative Visibility CullingPoint VisibilityPotentially Visible Set ComputationRay Space PartitioningVisibilityVisibility In Large-scale Scenes
From-region visibility culling is considered harder than from-point visibility culling, since it is inherently four-dimensional. We present a conservative occlusion culling method based on factorizing the 4D visibility problem into horizontal and vertical components. The visibility of the two components is solved asymmetrically: the horizontal component is based on a parameterization of the ray space, and the visibility of the vertical component is solved by incrementally merging umbrae. The technique is designed so that the horizontal and vertical operations can be efficiently realized together by modern graphics hardware. Similar to image-based from-point methods, we use an occlusion map to encode visibility; however, the image-space occlusion map is in the ray space rather than in the primal space. Our results show that the culling time and the size of the computed potentially visible set depend on the size of the viewcell. For moderate viewcells, conservative occlusion culling of large urban scenes takes less than a second, and the size of the potentially visible set is only about two times larger than the size of the exact visible set.
21
Marc Levoy, Pat Hanrahan · 1996 · 3.7K citations · Full text
Steven J. Gortler, Radek Grzeszczuk, Richard Szeliski et al. · 1996 · 2.5K citations · Full text
Hierarchical Z-buffer visibility
Ned Greene, Michael Kass, Gavin Miller · 1993 · 499 citations
Visibility preprocessing for interactive walkthroughs
Seth Teller, Carlo H. Séquin · 1991 · 403 citations