基于图象空间判据的地表模型加速绘制技术

在利用图形绘制实现虚拟现实的研究工作中，为了加速图形生成以保证实时的图形绘制，物体层次细节模型LoD(level of detail)的选择是其最主要的解决办法.其主要原理是根据物体对于观察者的重要性选择该物体绘制的细节.地表模型作为多边形网格模型的一种特殊几何模型，在各种虚拟现实系统中有着重要而广泛的应用.该文通过对地表模型实时生成特殊性要求的分析，提出具有焦点加权因子的基于图象空间误差的、适用于地表模型特殊性的、有效的加速简化方法.以焦点和显示面积的有效结合作为物体重要性评价尺度，有效地简化了地表模型的绘制.同时，算法结合均匀网格模型的多分辨率细节层次模型，以“块”作为地表模型大面积简化的空间单位，加速地表模型的简化操作，以实现较为复杂的地表模型的实时绘制.     

大区域地形可视化技术的研究

近年来，地形场景的实时绘制已受到人们越来越广泛的关注，目前已经提出的一系列场景加速绘制算法,虽然在不同的应用场合也取得了一定的效果，但都存在着局限性，尚不能满足大区域地形环境的实时高速绘制的要求，而与其密切相关的技术主要涉及到地形多分辨率表示、海量地形数据和纹理数据的分页管理、地形和纹理数据的LOD控制、地形和纹理数据的快速存取和更新等．为了能够对地形场景进行实时绘制，在对大区域地形数据管理和实时绘制技术进行研究和试验的基础上，对构建视相关动态多分辨率模型的方法进行了改进，实现了地形模型多分辨率表示与视相关的有机结合，并提出了一种高效的场景数据存取方法，进而实现了一个整合自适应三角网剖分、地形场景数据分页管理和动态更新等相关技术于一体的地形三维可视化系统，试验结果表明，该算法能够实时绘制地形场景，且质量较好．     

一种点面混合的复杂三维模型加速绘制方法

在主流个人计算机硬件条件下，为加速百万以上三角面片构成的复杂稠密几何模型的绘制速度，综合基于几何的建模与绘制方法GBMR和基于点的建模与绘制方法PBMR的优点，提出了一种同时使用三角面片和点作为基本单元进行对象建模与绘制的点面混合方法．在预处理阶段，对模型表面进行网格分割，存储子块三角面片和顶点点云数据，同时对顶点点云按顶点重要度排序并序列化为线性结构．在实时绘制阶段，进行视相关的裁剪和背面剔除，不同子块按视点距离分别由三角形或点进行绘制．以上过程充分利用图形处理单元GPU，实现了基于GPU的点面混合的对象连续多分辨率绘制，有效地提高了复杂模型的绘制效率．     

一种统一的硬件加速自适应EWA Splatting算法

提出了一种新的硬件加速自适应EWA(椭圆加权平均)Splatting算法框架,可同时适用于三维体数据和点模型.算法将高斯重建核与低通图像滤波核结合,得到反走样、无模糊的高质量图像.提出一种高效的白适应滤波方法,减少了高质量EWA Splatting的计算量.提出了自适应体EWA Splatting的3种数据存储模式和一系列高级特性,其中包括交互式分类、体一面混合绘制策略和自适应浮点累加.展示了如何在可编程图形处理单元(GPU)中计算体数据和点模型数据的EWA Splat基元.实验表明,文中的方法在一台普通微机上每秒可绘制1500万～2000万个基元,达到较高的图像质量与交互的绘制速度.     

一种快速的浓淡算洁及其实现

高逼真度浓淡效果的生成需要巨大的运算量，这使其很难用于实时计算机成象（ＣＩＧ）系统．本文从几何角度出发，在对整个三角形面元进行角度的增量化线性内插基础上，提出了一种具有高光效果的浓淡图形实时绘制算法，并给出了其硬件实现方法．     

双向纹理函数的有效压缩与绘制

提出了一种有效的BTF压缩方法：对简单BTF样本区域用一个统一的低频函数模拟整个区域的整体光照效果，再对每个像素生成一个高频函数来表现细节；对复杂样本区域则首先进行像素聚类，再在各个像素类内对视线采样方向自适应地聚类，在各个视线类内分别拟合一个低频函数，并求像素在各个视线内的高频函数，利用低频函数与高频函数的和重建了像素在相应视线类内的视觉效果．与局部PCA方法的对比表明，该文的算法取得了较高的压缩效率和更快的绘制速度，能实现交互的软件绘制和实时硬件绘制．     

基于线性八叉树的光线投射体绘制算法改进研究

体视化是地学信息三维可视化研究的前沿技术之一，体绘制算法的效率直接关系到体视化的效果。本文在研究已有光线投射体绘制改进算法的基础上，提出利用线性八叉树数据结构对光线投射体绘制算法进行改进研究，不仅实现了体数据的压缩。而且能对压缩体数据进行直接体视化。在PC机上的实验表明，该方法具有时间复杂度与数据复杂度基本无关的特点．加速效果明显。最后，文章指出了该方法的适用范围。     

基于标准PC机的大数据实时体绘制算法研究究

为了解决在标准PC机上对大数据进行实时体绘制的问题，提出了一种基于图形处理器的大数据高质量体绘制算法。该算法采用三维纹理映射作为核心的绘制算法，结合可见性测试、遮挡测试和模板测试来加快绘制速度。实验结果表明，对虚拟人体数据，可以在不损失图像质量的前提下，以可交互的速度进行绘制。     

基于GPU光线投射算法的心脏体数据三维可视化

心脏成像和可视化技术在心脏疾病诊断、治疗规划中发挥着重要作用。针对分割后的心脏体数据集,提出了使用图形处理器(GPU)加速光线投射算法进行高质量三维可视化的新方法。该方法结合心脏体数据统计信息设计传递函数,增大细微组织的不透明度值;基于梯度模自适应地调整采样步长,提高组织边界的采样频率;应用改进的Blinn-Phong多光源光照模型,增强可视化效果。实验结果表明,该方法在实现实时绘制的同时,能够获得高质量的体绘制效果,渲染出清晰的瓣膜和冠状动脉血管等心脏细微组织。     

点绘制技术的研究

对于形状复杂且不规则的物体，点绘制能实现高的绘制效率，还能获得高质量的绘制效果。该文讨论了点绘制方法的基本原理和基本绘制管道以及点绘制方法的硬件实现，并对今后研究和发展的方向进行了展望。     

基于二叉顶点树的视点相关实时LOD算法

本文提出了一种实时LOD算法，通过对二又顶点树的操作，实现在渲染过程中用不同的细节层次表示模型各部分。采用的细节层次的选择标准有：视见体剔除，背面剔除和屏幕空间的投影误差。实验结果表明该算法可以在保持一定的视觉效果的前提下，大大提高绘制效率。     

Seamless patches for GPU-based terrain rendering

In this paper we present a novel approach for interactive rendering of large terrain datasets. Our approach is based on subdividing a terrain into rectangular patches at different resolutions. Each patch is represented by four triangular tiles that are selected form different resolutions, and four strips which are used to stitch the four tiles in a seamless manner. Such a scheme maintains resolution changes within patches through the stitching strips, and not across patches. At runtime, these patches are used to construct a level-of-detail representation of the input terrain based on view-parameters. A selected level of detail only includes the layout of the patches and their boundary edges resolutions. The layout includes the location and dimension of each patch. Within the graphics hardware, the GPU generates the meshes of the patches by using scaled instances of cached tiles and assigns elevation for each vertex from cached textures. Since adjacent rectangular patches agree on the resolution of the common edges, the resulted mesh does not include cracks or degenerate triangles. Our algorithm manages to achieve quality images at high frame rates while providing seamless transition between different levels of detail.     

基于分形维数的地表模型多分辨率动态绘制

以基于分形维数的树状结构组织三维地表网格模型,实现了与视点相关的连续多分辨率地表模型简化及实时绘制.算法分为预处理和实时绘制两个阶段.在预处理阶段,通过分形维数评价地表的复杂度,建立自适应的树状结构,计算出所有顶点的误差值.在绘制阶段,则根据视距、视角等因素动态地确定需保留的顶点集,并采用受限四叉树方法实时三角化得到所需分辨率下的三角网格近似模型.该算法具有两个优点:一个是地表模型的分层区域划分考虑了地形本身的复杂度;另一个是建立了视点相关各参数与所采用的分辨率表示的直接关系.实验表明,此算法简单、有效,支持对地表模型的交互式实时动态绘制.     

Improved Model‐ and View‐Dependent Pruning of Large Botanical Scenes

We present an optimized pruning algorithm that allows for considerable geometry reduction in large botanical scenes while maintaining high and coherent rendering quality. We improve upon previous techniques by applying model‐specific geometry reduction functions and optimized scaling functions. For this we introduce the use of Precision and Recall (PR) as a measure of quality to rendering and show how PR‐scores can be used to predict better scaling values. We conducted a user‐study letting subjects adjust the scaling value, which shows that the predicted scaling matches the preferred ones. Finally, we extend the originally purely stochastic geometry prioritization for pruning to account for view‐optimized geometry selection, which allows to take global scene information, such as occlusion, into consideration. We demonstrate our method for the rendering of scenes with thousands of complex tree models in real‐time.     

基于层次聚类树的点曲面视点相关绘制

针对点曲面的视点相关绘制问题,提出了一个新的表面基层次聚类简化算法。区别于普遍采用的空间剖分基策略,该算法的显著优势在于能够运用法向锥半角误差标准有效跟踪曲面的起伏变化,并以此为聚类简化过程提供可靠的全局误差控制。离线简化阶段,连同各种预定义的聚类约束条件,算法构造了点曲面模型的连续层次多分辨率表达。实时绘制阶段,层次可见性裁剪以及优化的树遍历提高了系统的整体性能。此外,通过引入附加的轮廓增强机制,在较大的屏幕投影误差和较高的模型简化率情况下,系统仍然能够保证较好的绘制视觉质量。     

交互式动态体绘制及其加速算法

体绘制三维成象法是一门新兴的3D采样数据场可视化技术，在医学成象和科学可视化领域有着极为广泛的应用，但由于3D数据量大，其使用往往受到巨大计算开销的限制，因此很多研究人员致力于静态体绘制加速算法的研究，并解决医学图象三维可视化中三维体数据显示速度与成象质量问题，因而提出了一种交互式动态体绘制算法，即从任意的视点距离和视线方向进行动态编制，并在分析其算法复杂度的基础上，提出一种新的加速算法，同时使得动态体绘制过程几乎达到实时的效果，经验证，这种算法比标准算法快4～5倍。     

Visualization of Large‐Scale Urban Models through Multi‐Level Relief Impostors

In this paper, we present an efficient approach for the interactive rendering of large‐scale urban models, which can be integrated seamlessly with virtual globe applications. Our scheme fills the gap between standard approaches for distant views of digital terrains and the polygonal models required for close‐up views. Our work is oriented towards city models with real photographic textures of the building facades. At the heart of our approach is a multi‐resolution tree of the scene defining multi‐level relief impostors. Key ingredients of our approach include the pre‐computation of a small set of zenithal and oblique relief maps that capture the geometry and appearance of the buildings inside each node, a rendering algorithm combining relief mapping with projective texture mapping which uses only a small subset of the pre‐computed relief maps, and the use of wavelet compression to simulate two additional levels of the tree. Our scheme runs considerably faster than polygonal‐based approaches while producing images with higher quality than competing relief‐mapping techniques. We show both analytically and empirically that multi‐level relief impostors are suitable for interactive navigation through large urban models.     

Real‐Time Isosurface Extraction With View‐Dependent Level of Detail and Applications

Volumetric scalar data sets are common in many scientific, engineering and medical applications where they originate from measurements or simulations. Furthermore, they can represent geometric scene content, e.g. as distance or density fields. Often isosurfaces are extracted, either for indirect volume visualization in the former category, or to simply obtain a polygonal representation in case of the latter. However, even moderately sized volume data sets can result in complex isosurfaces which are challenging to recompute in real time, e.g. when the user modifies the isovalue or when the data itself are dynamic. In this paper, we present a GPU‐friendly algorithm for the extraction of isosurfaces, which provides adaptive level of detail rendering with view‐dependent tessellation. It is based on a longest edge bisection scheme where the resulting tetrahedral cells are subdivided into four hexahedra, which then form the domain for the subsequent isosurface extraction step. Our algorithm generates meshes with good triangle quality even for highly non‐linear scalar data. In contrast to previous methods, it does not require any stitching between regions of different levels of detail. As all computation is performed at run time and no pre‐processing is required, the algorithm naturally supports dynamic data and allows us to change isovalues at any time.     

A Fast Ambient Occlusion Method for Real-Time Plant Rendering

Global illumination effects are crucial for virtual plant rendering. Whereas real-time global illumination rendering of plants is impractical, ambient occlusion is an efficient alternative approximation. A tree model with millions of triangles is common, and the triangles can be considered as randomly distributed. The existing ambient occlusion methods fail to apply on such a type of object. In this paper, we present a new ambient occlusion method dedicated to real time plant rendering with limited user interaction. This method is a three-step ambient occlusion calculation framework which is suitable for a huge number of geometry objects distributed randomly in space. The complexity of the proposed algorithm is O（n）, compared to the conventional methods with complexities of O（n^2）. Furthermore, parameters in this method can be easily adjusted to achieve flexible ambient occlusion effects. With this ambient occlusion calculation method, we can manipulate plant models with millions of organs, as well as geometry objects with large number of randomly distributed components with affordable time, and with perceptual quality comparable to the previous ambient occlusion methods.