ABSTRACT
Occlusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a new general algorithm that performs the visibility precomputation for a group of viewcells in an output-sensitive fashion. This is achieved by exploiting the directional coherence of visibility between adjacent viewcells. The algorithm is independent of the underlying from-region visibility solver and is therefore applicable to exact, conservative and aggressive visibility solvers in both 2D and 3D.
- Bernardini, F., El-Sana, J., and Klosowski, J. T. 2000. Directional discretized occluders for accelerated occlusion culling. Computer Graphics Forum (Eurographics '00) 19, 3, 507--516.Google Scholar
- Bittner, J., and Wonka, P. 2003. Visibility in computer graphics. Environment and Planning B: Planning and Design 30, 5, 729--756.Google ScholarCross Ref
- Bittner, J., Havran, V., and Slavik, P. 1998. Hierarchical visibility culling with occlusion trees. In Proceedings of Computer Graphics International '98, 207--219. Google ScholarDigital Library
- Bittner, J., Wimmer, M., Piringer, H., and Purgathofer, W. 2004. Coherent hierarchical culling: Hardware occlusion queries made useful. Computer Graphics Forum (Eurographics '04) 23, 3, 615--624.Google Scholar
- Bittner, J. 2002. Hierarchical Techniques for Visibility Computations. PhD thesis, Czech Technical University in Prague, Department of Computer Science and Engineering.Google Scholar
- Cohen-Or, D., Fibich, G., Halperin, D., and Zadicario, E. 1998. Conservative visibility and strong occlusion for views-pace partitioning of densely occluded scenes. Computer Graphics Forum (Eurographics '98) 17, 3, 243--254.Google Scholar
- Cohen-Or, D., Chrysanthou, Y., Silva, C. T., and Durand, F. 2003. A survey of visibility for walkthrough applications. IEEE Transactions on Visualization and Computer Graphics 9, 3, 412--431. Google ScholarDigital Library
- Coorg, S., and Teller, S. 1997. Real-time occlusion culling for models with large occluders. In Proceedings of the 1997 symposium on Interactive 3D graphics, ACM Press, 83--90. Google ScholarDigital Library
- Durand, F., Drettakis, G., Thollot, J., and Puech, C. 2000. Conservative visibility preprocessing using extended projections. Proceedings of ACM SIGGRAPH 2000. Google ScholarDigital Library
- Gotsman, G., Sudarsky, O., and Fayman, J. 1999. Optimized occlusion culling using five-dimensional subdivision. Computer & Graphics 23, 5, 645--654.Google ScholarCross Ref
- Koltun, V., Chrysanthou, Y., and Cohen-Or, D. 2000. Virtual occluders: An efficient intermediate PVS representation. In Rendering Techniques 2000: 11th Eurographics Workshop on Rendering, 59--70. Google ScholarDigital Library
- Leyvand, T., Sorkine, O., and Cohen-Or, D. 2003. Ray space factorization for from-region visibility. ACM Transactions on Graphics (SIGGRAPH 2003) 22, 3, 595--604. Google ScholarDigital Library
- Nirenstein, S., and Blake, E. 2004. Hardware accelerated aggressive visibility preprocessing using adaptive sampling. In Rendering Techniques 2004: Proceedings of the 15th Eurographics Symposium on Rendering, 207--216. Google ScholarDigital Library
- Nirenstein, S., Blake, E., and Gain, J. 2002. Exact from-region visibility culling. In Rendering Techniques 2002: Proceedings of the 13th Eurographics Workshop on Rendering, 199--210. Google ScholarDigital Library
- Schaufler, G., Dorsey, J., Decoret, X., and Sillion, F. X. 2000. Conservative volumetric visibility with occluder fusion. Proceedings of ACM SIGGRAPH 2000, 229--238. Google ScholarDigital Library
- Teller, S. J., and Séquin, C. H. 1991. Visibility preprocessing for interactive walkthroughs. Computer Graphics (Proceedings of ACM SIGGRAPH '91) 25, 4, 61--70. Google ScholarDigital Library
- Wonka, P., Wimmer, M., and Sillion, F. 2001. Instant visibility. Computer Graphics Forum (Eurographics '01) 20, 3.Google Scholar
Index Terms
- A general algorithm for output-sensitive visibility preprocessing
Recommendations
Ray space factorization for from-region visibility
SIGGRAPH '03: ACM SIGGRAPH 2003 PapersFrom-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 ...
Conservative visibility preprocessing using extended projections
SIGGRAPH '00: Proceedings of the 27th annual conference on Computer graphics and interactive techniquesVisualization 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 ...
Ray space factorization for from-region visibility
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 ...
Comments