检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长春理工大学计算机科学技术学院,长春130022
出 处:《吉林大学学报(信息科学版)》2013年第6期615-620,共6页Journal of Jilin University(Information Science Edition)
基 金:国家科技支撑计划基金资助项目(2009BAE69B01);中国博士后科学基金资助项目(20110491304)
摘 要:为快速判断高度场场景点的通视性和可见范围,满足交互式应用的需要,提出低复杂度高度场基于可见二叉树的凸包树简化方法。通过对高度场数据在8个方向的线性扫描,确定每个高度场数据点的最大方位角,构造凸包树型结构;对凸包树信息进行分析,构造可见性二叉树作为方向扫描存储结构,在光照计算过程中有效提高可见点的搜索算法效率;结合阴影图的间接光照计算,实现了交互式帧率的动态低复杂度高度场绘制效果模拟,降低计算成本。In order to quickly determine the Intervisibility and visible range of height field scene, to meet the requirements of interactive applications, a novel method is proposed for low complexity height field with a simplified convex hull and a binary tree. Through a linear scan in eight directions on height field determined each maximum azimuth, a convex hull tree structure is constructed Information on the convex hull tree is analysed and simplified, Binary tree structure is treated as a storage structure for direction visibility scan, which can effectively improve search efficiency in the lighting calculation for visible point determination. Combined with indirect lighting calculations based on shadow map, the interactive frame rate of field rendering is achieved, reducing the computational cost effectiwlv. complexity dynamic height
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145