Tighter bounding volumes for better occlusion culling performance

DSpace Repository


URI: http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-22880
Dokumentart: Report
Date: 2005
Source: WSI ; 2005 ; 13
Language: English
Faculty: 7 Mathematisch-Naturwissenschaftliche Fakultät
Department: Sonstige - Informations- und Kognitionswissenschaften
DDC Classifikation: 004 - Data processing and computer science
Keywords: Polygonnetz , Polytop , Verdeckungsrechnung , Culling <Computergraphik>
Other Keywords: Verdeckungsrechznung , Grenzvolumen , große Daten
Visibility occlusion culling , bounding volumes , large scale data visualization
License: http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=de http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=en
Show full item record


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.

This item appears in the following Collection(s)