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

一种基于视角剖分的可见性算法
引用本文:潘志庚,傅国良,王毅刚. 一种基于视角剖分的可见性算法[J]. 系统仿真学报, 2004, 16(4): 749-751
作者姓名:潘志庚  傅国良  王毅刚
作者单位:1. 杭州电子工业学院,虚拟现实与多媒体研究所,杭州,310018;浙江大学CAD&CG国家重点实验室,杭州,310027
2. 杭州电子工业学院,虚拟现实与多媒体研究所,杭州,310018
基金项目:浙江省自然科学基金优秀人才基金(RC40008),教育部优秀青年教师教学科研奖励计划共同资助。
摘    要:文中提出了一种适用于在给定视点运动路径情况下,处理三维场景的可见性预处理算法。首先对所有可能的视线方向所对应的立方体进行细分,然后对分割后的平面沿着运动路径移动所形成的光束体进行可见性预处理,最后合并这些光束体得到对该运动路径的可能可见面集合(PVS)。由于能够有效的剔除被较大的物体遮挡的小物体,使得PVS中的面片数量远小于整个场景的面片数目,这样就可以避免绘制完全不可见的物体,从而提高场景的实时绘制的速度。

关 键 词:虚拟场景  剔除  可见性  可能可见面集合
文章编号:1004-731X(2004)04-0749-03
修稿时间:2004-02-28

A Visibility Algorithm Based on Subdivision of View Angle
PAN Zhi-geng,,FU Guo-liang,WANG Yi-gang. A Visibility Algorithm Based on Subdivision of View Angle[J]. Journal of System Simulation, 2004, 16(4): 749-751
Authors:PAN Zhi-geng    FU Guo-liang  WANG Yi-gang
Affiliation:PAN Zhi-geng1,2,FU Guo-liang1,WANG Yi-gang1
Abstract:This paper presents a visibility preprocessing algorithm for 3D scene, which is suitable for the occasion that the moving path of viewpoint is given. We use a subdivision of the cube which is corresponding to every orientation, to process the visibility by means of the light volume, and to calculate a conservative potentially visible set for a given path. The proposed method could efficiently cull the small objects which are occluded by other large objects, so the number of potentially visible objects on each viewpoint are much less than the number of objects in the entire scene, and it can improve the speed of rendering scene for it avoids rendering the invisible objects.
Keywords:virtual scene  cull  visibility  potentially visible set
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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