Tighter bounding volumes for better occlusion culling performance

DSpace Repository

Show simple item record

dc.contributor WSI/GRIS - VCM ; IBM T.J. Watson Research Center, Hawthorne, USA de_DE
dc.contributor.author Bartz, Dirk de_DE
dc.contributor.author Klosowski, James T. de_DE
dc.contributor.author Staneker, Dirk de_DE
dc.date.accessioned 2006-05-05 de_DE
dc.date.accessioned 2014-03-18T10:15:40Z
dc.date.available 2006-05-05 de_DE
dc.date.available 2014-03-18T10:15:40Z
dc.date.issued 2005 de_DE
dc.identifier.other 286964554 de_DE
dc.identifier.uri http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-22880 de_DE
dc.identifier.uri http://hdl.handle.net/10900/48915
dc.description.abstract Bounding volumes are used in computer graphics to approximate the actual geometric shape of an object in a scene. The main intention is to reduce the costs associated with visibility or interference tests. The bounding volumes most commonly used have been axis-aligned bounding boxes and bounding spheres. In this paper, we propose the use of discrete orientation polytopes (\kdops) as bounding volumes for the specific use of visibility culling. Occlusion tests are computed more accurately using \kdops, but most importantly, they are also computed more efficiently. We illustrate this point through a series of experiments using a wide range of data models under varying viewing conditions. Although no bounding volume works the best in every situation, {\kdops} are often the best, and also work very well in those cases where they are not the best, therefore they provide good results without having to analyze applications and different bounding volumes. en
dc.language.iso en de_DE
dc.publisher Universität Tübingen de_DE
dc.rights ubt-podno de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=de de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=en en
dc.subject.classification Polygonnetz , Polytop , Verdeckungsrechnung , Culling <Computergraphik> de_DE
dc.subject.ddc 004 de_DE
dc.subject.other Verdeckungsrechznung , Grenzvolumen , große Daten de_DE
dc.subject.other Visibility occlusion culling , bounding volumes , large scale data visualization en
dc.title Tighter bounding volumes for better occlusion culling performance en
dc.type Report (Bericht) 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 2288 de_DE
utue.opus.portal wsi de_DE
utue.opus.portalzaehlung 2005.13000 de_DE
utue.publikation.source WSI ; 2005 ; 13 de_DE
utue.publikation.reihenname WSI-Reports - Schriftenreihe des Wilhelm-Schickard-Instituts für Informatik de_DE
utue.publikation.zsausgabe 2005, 13
utue.publikation.erstkatid 2919855-0


This item appears in the following Collection(s)

Show simple item record