Online Occlusion Culling

G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.

Download
No fulltext has been uploaded.
Conference Paper | Published | English
Author
;
Abstract
Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.<br>We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well.
Publishing Year
Proceedings Title
Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)
Volume
3669
Page
758-769
LibreCat-ID

Cite this

Frahling G, Krokowski J. Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:10.1007/11561071_67
Frahling, G., & Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. https://doi.org/10.1007/11561071_67
@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={10.1007/11561071_67}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer}, author={Frahling, Gereon and Krokowski, Jens}, year={2005}, pages={758–769} }
Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:758–69. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/11561071_67.
G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769.
Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search