{"place":"Bad Schussenried","citation":{"mla":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–78.","bibtex":"@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc. of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001}, pages={275–278} }","ama":"Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: <i>Proc. of 3. GI-Informatiktage 2001</i>. Bad Schussenried; 2001:275-278.","ieee":"J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–278.","apa":"Klein, J., &#38; Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In <i>Proc. of 3. GI-Informatiktage 2001</i> (pp. 275–278). Bad Schussenried.","short":"J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.","chicago":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” In <i>Proc. of 3. GI-Informatiktage 2001</i>, 275–78. Bad Schussenried, 2001."},"file_date_updated":"2020-08-26T13:08:08Z","user_id":"15415","ddc":["000"],"_id":"18370","page":"275 - 278","has_accepted_license":"1","status":"public","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-26T13:08:24Z","file":[{"date_updated":"2020-08-26T13:08:08Z","relation":"main_file","access_level":"closed","file_size":146136,"file_name":"hni-id-1450.pdf","content_type":"application/pdf","success":1,"file_id":"18371","creator":"koala","date_created":"2020-08-26T13:08:08Z"}],"abstract":[{"lang":"eng","text":"We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low."}],"publication":"Proc. of 3. GI-Informatiktage 2001","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:30Z","author":[{"full_name":"Klein, Jan","first_name":"Jan","last_name":"Klein"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"}],"year":"2001","title":"Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph"}