Exploiting Hardware-Accelerated Occlusion Queries for Visibility Culling(Computer Graphics)

スポンサーリンク

概要

• 論文の詳細を見る

• Visibility culling techniques have been studied extensively in computer graphics for interactive walkthrough applications in recent years. In this paper, a visibility culling approach by exploiting hardware-accelerated occlusion query is proposed. Organizing the regular grid representation of input scene as an octree-like hierarchy, a 2-tier view frustum culling algorithm is to efficiently cull away nodes invisible from a given viewpoint. Employing the eye-siding number of nodes, we can quickly enumerate an occlusion front-to-back order and effectively maximize the number of parallelizable occlusion queries for nodes while traversing the hierarchy. As experimental results show, our approach improves the overall performance in the test walkthrough.

• 社団法人電子情報通信学会の論文
• 2005-07-01

著者

• Tai Wen

  Department Of Computer Science And Information Engineering National Dong Hwa University

• Chiang Cheng

  Department Of Computer Science And Information Engineering National Dong Hwa University

• HSU Chih

  Department of Computer Science and Information Engineering, National Dong Hwa University

• YANG Mau

  Department of Computer Science and Information Engineering, National Dong Hwa University

• Yang Mau

  Department Of Computer Science And Information Engineering National Dong Hwa University

• Tai Wen‐kai

  Department Of Computer Science And Information Engineering National Dong Hwa University

• Hsu Chih

  Department Of Computer Science And Information Engineering National Dong Hwa University

関連論文

• Exploiting Hardware-Accelerated Occlusion Queries for Visibility Culling(Computer Graphics)
• Determining Front-Facing Polygons for Dynamic and Deformable Objects(Computer Graphics)

スポンサーリンク