检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈纯毅[1,2] 杨华民[1] 李文辉[2] 蒋振刚[1]
机构地区:[1]长春理工大学计算机科学与技术学院,长春130022 [2]吉林大学计算机科学与技术学院,长春130012
出 处:《吉林大学学报(工学版)》2013年第5期1352-1358,共7页Journal of Jilin University:Engineering and Technology Edition
基 金:国家科技支撑计划项目(2009BAE69B01);中国博士后科学基金项目(20110491304)
摘 要:基于即时光能辐射度方法的虚拟点光源思想,提出一种新的动态场景间接光照近似求解算法。首先设计出可视场景区域敏感的虚拟点光源采样策略和基于间隔采样的间接光照贡献聚集方法,并给出它们在GPU上的实现途径。然后提出虚拟点光源的帧间重用与更新方法,实现了对虚拟点光源的帧间失效检测、重建及其抛物面阴影图的更新。本文算法将动态场景当作一个整体处理,无需预先区分和指定静态对象和动态对象。实验结果表明,本文算法能够显著地减少动态场景间接光照的平均计算时间。Based on the idea of virtual point lights used by instant radiosity, a novel algorithm for approximate calculation of the indirect illumination of dynamic scenes was proposed. First, the view- sensitive sampling strategy of virtual point lights and the interleaved-sampling based method of indirect illumination gathering were designed, and their Graphic Processing Unit (GPU) implementation was further presented. Second, the method for reusing and updating virtual point lights among consecutive frames was suggested. Based on this method, the validity testing, reconstruction and paraboloid shadow-map update of virtual point lights were realized. The proposed algorithm treats the dynamic scene as a whole and does not need to obtain the information with respect to static and dynamic objects in advance. Experiment results show that the algorithm can significantly reduce the average computation time of indirect illumination of dynamic scenes.
关 键 词:计算机应用 间接光照 虚拟点光源 帧间重用 重要性采样
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249