首页 | 本学科首页   官方微博 | 高级检索  
     

基于深度缓存和BSP树技术的表面消隐技术研究
引用本文:张雷,王悦,雷玉常. 基于深度缓存和BSP树技术的表面消隐技术研究[J]. 电脑开发与应用, 2012, 25(7): 5-8. DOI: 10.3969/j.issn.1003-5850.2012.07.003
作者姓名:张雷  王悦  雷玉常
作者单位:1.广东科贸职业学院,广州,510430;2.重庆工业自动化仪表研究所,重庆,401123
摘    要:主要介绍了两种消隐技术,深度缓存算法是通过两个缓存来实现的,其中的一个是用来存放颜色的颜色缓存器,而另一个是用来存放深度的深度缓存器.BSP就是二叉空间分区树,将视景中要显示的多边形或者实物,使用二叉树的原理组织成一种数据结构,通过这种数据结构存储多边形(实物).

关 键 词:BSP树  深度缓存算法  表面消隐  油画算法  逆油画算法

Research on Surface Blanking Technology Based on Depth Buffer and BSP Tree
ZHANG Lei , WANG Yue , LEI Yu-chang. Research on Surface Blanking Technology Based on Depth Buffer and BSP Tree[J]. Computer Development & Applications, 2012, 25(7): 5-8. DOI: 10.3969/j.issn.1003-5850.2012.07.003
Authors:ZHANG Lei    WANG Yue    LEI Yu-chang
Affiliation:1. Guangdong Vocational College of Science and Trade,Guangzhou 510430,China, 2. Chongqing Institute of Industrial Automation and Instrumention ,Chong qing 401123 ,China)
Abstract:This paper describes two blanking technology. Depth buffer algorithm is achieved through two caches, one of which is used to store the color of the color buffer, while the other is used to store the depth of the depth buffer. BSP is a binary space partition tree, the scene of polygons to be displayed or in kind, using the principles of organization into a binary tree data structure,the polygon(in kind) is stored by means of this data structure.
Keywords:BSP tree  depth buffer algorithm   surface blanking   painting algorithm  anti-painting algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号