Efficient multiple occlusion queries for scene graph systems

DSpace Repository

Show simple item record

dc.contributor Tübingen / Wilhelm-Schickard-Institut für Informatik de_DE
dc.contributor.author Staneker, Dirk de_DE
dc.contributor.author Bartz, Dirk de_DE
dc.contributor.author Straßer, Wolfgang de_DE
dc.date.accessioned 2005-02-21 de_DE
dc.date.accessioned 2014-03-18T10:13:49Z
dc.date.available 2005-02-21 de_DE
dc.date.available 2014-03-18T10:13:49Z
dc.date.issued 2004 de_DE
dc.identifier.other 116798807 de_DE
dc.identifier.uri http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-15480 de_DE
dc.identifier.uri http://hdl.handle.net/10900/48707
dc.description.abstract Image space occlusion culling is an useful approach to reduce the rendering load of large polygonal models. Like most large model techniques, it trades overhead costs with the rendering costs of the possibly occluded geometry. Meanwhile, modern graphics hardware supports occlusion culling. Unfortunately these hardware extensions consume fillrate and latency costs. In this paper, we propose a new technique for scene graph traversal optimized for efficient use of occlusion queries. Our approach uses several Occupancy Maps to organize the scene graph traversal. During traversal hierarchical occlusion culling, view frustrum culling and rendering is performed. The occlusion information is efficiently determined by asynchronous multiple occlusion queries with hardware-supported query functionality. To avoid redundant results, we arrange these multiple occlusion queries according to the information of several Occupancy Maps. Our presented technique is conservative and benefits from a partial depth order of the geometry. en
dc.language.iso en de_DE
dc.publisher Universität Tübingen de_DE
dc.rights ubt-podok de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=de de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=en en
dc.subject.classification Rendering , Verdeckungsrechnung , Szenengraph , Culling <Computergraphik> de_DE
dc.subject.ddc 004 de_DE
dc.subject.other Occlusion Culling , Rendering , Verdeckungsrechnung , Szenengraphen de_DE
dc.subject.other Occlusion Culling , Rendering , Visibility , Scene Graph en
dc.title Efficient multiple occlusion queries for scene graph systems en
dc.type Report de_DE
dc.date.updated 2012-10-11 de_DE
utue.publikation.fachbereich Sonstige - Informations- und Kognitionswissenschaften de_DE
utue.publikation.fakultaet 7 Mathematisch-Naturwissenschaftliche Fakultät de_DE
dcterms.DCMIType Text de_DE
utue.publikation.typ report de_DE
utue.opus.id 1548 de_DE
utue.opus.portal wsi de_DE
utue.opus.portalzaehlung 2004.06000 de_DE
utue.publikation.source WSI ; 2004 ; 6 de_DE
utue.publikation.reihenname WSI-Reports - Schriftenreihe des Wilhelm-Schickard-Instituts für Informatik de_DE
utue.publikation.zsausgabe 2004, 6
utue.publikation.erstkatid 2919855-0


This item appears in the following Collection(s)

Show simple item record