z-logo
Premium
Analysis of coherence strategies for stereo occlusion culling
Author(s) -
Mansa Ignacio,
Amundarain Aiert,
Matey Luis,
GarcíaAlonso Alejandro
Publication year - 2008
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.215
Subject(s) - computer science , occlusion , computer vision , artificial intelligence , rendering (computer graphics) , frame rate , coherence (philosophical gambling strategy) , computer graphics (images) , mathematics , medicine , statistics , cardiology
This paper explores the benefits that can be achieved for stereoscopic visualization when using occlusion culling strategies. Graphics processing units (GPUs) are improving their computational power and functionalities. On the other hand, models are also increasing their size and users require more demanding image quality. Occlusion culling provides significant frame rate speed‐ups in densely occluded scenarios. This paper shows the limitations placed by compact and not densely occluded scenarios and the gains that can be achieved when rendering stereo images using occlusion culling. The experiments carried out test combinations of occlusion stereo coherence and occlusion frame coherence. The methods also take advantage of efficient depth sorting strategy and aggressive occlusion frame coherence, whose image artefacts have been found to be negligible. Results clearly point out that eye‐independent frame coherence offers more benefits than mixing frame and stereo coherence. As in monoscopic occlusion culling, using simplified geometric models, instead of bounding boxes, when posting occlusion queries, improves significantly the number of objects discriminated as occluded. The algorithm presented can be easily implemented and provides a significant boost in performances. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here