View Frustum Culling Algorithm for Scene Based on Adaptive Binary Tree
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Building realistic and rich 3D scenes is the main task of visualization. The data management and visibility judgments of the scene play a crucial role in the quality and efficiency of subsequent rendering. In order to make up for the shortcomings of traditional scene organization in practical application, this study adopts the adaptive binary tree scene organization algorithm to manage the scene, and uses the hierarchical cutting method to cut the nodes of the scene tree. In the process of cutting, the object of the operation is the bounding sphere and bounding box in the node. Experiments show that this layered algorithm based on the bounding sphere and bounding box greatly reduces the number of nodes involved in cutting and improves the accuracy of cutting. It has better cutting efficiency and high stability.

    Reference
    Related
    Cited by
Get Citation

牛鹏,廉东本,苏谟.基于自适应二叉树的场景视锥体裁剪算法.计算机系统应用,2018,27(3):228-232

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 13,2017
  • Revised:June 30,2017
  • Adopted:
  • Online: February 11,2018
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063