检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学多媒体研究开发中心,长沙410073
出 处:《计算机辅助设计与图形学学报》2007年第6期792-797,共6页Journal of Computer-Aided Design & Computer Graphics
基 金:国家自然科学基金(60473117);武器装备预研基金(51404040105KG0135)
摘 要:在场景分割的基础上,提出一种连续分层层次细节模型组织场景,并对视点空间进行划分,为每个视点单元计算恰好满足单元内任意视点屏幕像素误差的场景图节点列表,称为cell-front;然后利用cell-front对外存模型的存储进行重新设计.在绘制时采用多线程技术,绘制线程对当前cell-front进行可见性剔除和视点相关的选择绘制;预取线程采用一种基于视点单元的预取策略,利用视点单元之间cell-front的变化控制预取数据的调度.该算法能够在保证场景绘制质量的前提下,在普通的PC机上实现大规模外存场景的实时交互显示.This paper presents a novel method for representing a scene with continuous hierarchical levels of detail, and organizing the scene into sub-regions according to the view points by what is called ceil-front. A cell-front is a scene graph node list that can rightly meet the screen space error bound within a view region. Then the disk layout of the out-of-core geometry model is redesigned. In run-time, the multithreaded technique is used. The rendering thread constructs the cell-front for the current view cell and renders the geometries through visibility culling and view-dependent refinement. The prefetch thread employs a region-based prefetch strategy, to control the data prefetch based on the difference between neighboring cells' cell-front. The algorithm can perform interactive out-of-core rendering for large-scale complex environments on commodity PC with fine image quality.
关 键 词:交互绘制 大规模场景 连续分层层次细节模型 可见性剔除 外存算法
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.41.2