通过子区域投影方法直接绘制三维数据场

直接的体绘制技术提供了在一幅图形显示三维数据场各种信息的巨大替力，然而，生成这样的图形是极其昂贵的，而且高质量图的绘制远远达不到交互实现的水平。与光线投射方法每次独立地处理一条光线相比，体绘制的体元投影方法按一定的顺序逐一处理数据场内每一个体元，图形绘制的复杂性是Ｏ（ｎ）（ｎ是数据场体元个数，即三个方向长度的乘积）。体元投影方法引起人们极大的兴趣是因为在处理过程中充分地利用了体元的空间连贯性。本文     

三维数据场实时体绘制研究进展

在分析了三维数据场实时体绘制研究现状的基础上，重点探讨了三维数据场实时体绘制的五种方法：降低采样维数法、空间相关性法、跳过空体元法、基于硬件的方法及并行处理的方法，并比较了各种绘制算法的特点，从而指明了三维数据场实时体绘制进一步研究的方向。     

利用相关性进行非规则数据场体绘制

文中给出了一种利用象互相关性进行非规则数据场体绘制的方法。该方法通过分割图象空间，遍历体元后向相邻关系以建立基本可见性次序，以扫描转换方法求交和完成交点插值。最后在基本序的基础上适当调整，完成体绘制。     

空间相关脚印方法;一种快速体绘制方法

提出的一种新的体绘制方法：空间相关脚印方法，充分利用数据空间的相关性，把体元分为分界体元和内部体元，并将内部体元合并成块，对分界体元和块按不同方法计算和绘制。理论分析与实验结果表明，新的方法比Ｗｅｓｔｏｖｅｒ提出的脚印方法在绘制速率上提高了一倍左右，并且绘制出的图象突出了物质分界面。     

非规则数据场体绘制光线投射求交的加速新方法

光线投射是非规则数据场体绘制的一种常用方法。它能生成高质量的图形，但开销很大。其原因在于光线与面的求交，特别是与外部面的求交，需要非常大的工作量。本文利用平面多边形扫描算法求取光线与外部面的交点，井利用内部体元和面的相关性，改进了光线与内部面的求交计算，从而减少了运算量，提高了绘制速度。     

直接体绘制技术在地质体三维可视化中的应用研究*

将直接体绘制技术应用于地质体三维可视化,首先对原始钻孔数据进行插值、网格化等预处理得到满足直接体绘制需要的规则体数据,从而建立反映地层分布的地质体三维标量数据场;然后用直接体绘制技术绘制三维地质体,避免了体元建模方法中在对地质体进行剖切等操作时必须要解决的剖面与体元之间复杂的判断求交等过程。采用该方法实现了对某地区地质体的三维可视化。     

基于微机环境的三维数据场多等值面快速显示算法

直接体绘制技术能够利用半透明效果显示三维数据场，提供了比等值面绘制方法更为丰富的信息，但是，由于数据场中所有体素都参与了图象生成过程，使得该技术的计算开销昂贵，远远无法达到交互式操作的要求。事实上，如果用边界表示法来表示三维数据场，就可以利用三维空间连续性来大幅度缩短绘制时间。边界表示法只关心有值面穿过的边界体元，用Ｏ内存单元来表示大小的原始数据场，从而产生大规模数据压缩。本文在此基础上提出一种基     

图形硬件辅助的快速数据场体绘制方法

本文以规则数据场的体绘制过程进行了讨论，在此基础上给出一种图形硬件辅助的体绘制方法，该方法通过ＧＯｐｅｎＧＬ提供的函数和接口，利用高性能图形工作站ＳＧＩ的硬件支持快速实现规则数据场的体绘制。本文给出实现方法以及实验结果。     

基于分块混合八叉树编码的海量体视化研究

在介绍当前体数据的数据模型与绘制方法的基础上，使用混合八叉树进行体数据的描述，实现了对其自适应分块存储。并用体元投射和三维纹理映射方法分别实现了混合八叉树的体绘制与多分辨率绘制。实验结果表明，该文的算法较好地实现了基于混合八叉树结构的海量体数据的组织、存储和绘制。     

基于可见性选择体元的投影成像体绘制方法

基于可见性避免了对不可见体元的合成操作,是提高体绘制速度的有效方法.为此提出了一种方法,根据体元基于体元面的相邻性及累积非透明度没有饱和的像素来挑选体元进行处理.这使得投影成像方法能有效地避免处理不可见体元.该方法不仅适用于平行投影和透视投影的成像运算,而且能处理各种规则场和非规则场.     

基于时空一致性的非结构化网格时变流场高效体绘制方法

时空一致性是时变流场的重要性质,也是加速时变数据可视化算法的关键.以硬件加速的光线投射算法(HRC)为框架,设计并实现了一种基于时空一致性的非结构化网格时变流场高效体绘制方法.首先提出一种分析非结构化网格单元和顶点数据时间一致性的方法,分别建立单元和顶点数据时间表,以降低绘制过程中的计算开销;然后设计一种单元和顶点数据相分离的GPU纹理结构,并采用一种小巧的单元梯度矩阵来降低显存开销;同时,设计了一种合理的数据调度策略,既能有效地避免绘制停顿,又使显存纹理结构更为紧致、高效.实验结果表明,该方法不仅明显地提高了绘制效率,而且具有更优显存空间利用率,能实现更大网格规模的非结构化网格时变流场数据体绘制.     

An image division approach for volume ray casting in multi-threading environment

For an efficient parallel volume ray casting suitable for recent multi-core CPUs, we propose an image-ordered approach by using a cost function to allocate loaded tasks impartially per each processing node. At the first frame, we divide an image space evenly, and we compute a cost function. By applying the frame coherence property, we divide the image space unevenly using the computed previous cost function since the next frame. Conventional image-ordered parallel approaches have focused on dividing and compositing volume datasets. However, the divisions and accumulations are negligible for recent multi-core CPUs because they are performed inside one physical CPU. As a result, we can reduce the rendering time without deteriorating the image quality by applying a cost function reflecting on all time-consuming steps of the volume ray casting.     

基于有效裁剪被遮挡单元的非规则数据场体绘制算法

提出了一种被遮挡单元的裁剪算法,以加速非规则数据场的体绘制过程。在基于一组平行切割平面的体绘制方法上,新算法通过对图像不透明度缓冲区中的值进行求平均操作,并将所计算的结果存储在一个与不透明度缓冲区间同样大小的平均不透明度缓冲区中,使得只需根据每一数据单元重心投影点在平均不透明度缓冲区中的值,就可得到此数据单元的可见性,从而有效裁剪掉被遮挡单元,降低需处理的数据量,加速体绘制过程。     

Topology-controlled volume rendering

Topology provides a foundation for the development of mathematically sound tools for processing and exploration of scalar fields. Existing topology-based methods can be used to identify interesting features in volumetric data sets, to find seed sets for accelerated isosurface extraction, or to treat individual connected components as distinct entities for isosurfacing or interval volume rendering. We describe a framework for direct volume rendering based on segmenting a volume into regions of equivalent contour topology and applying separate transfer functions to each region. Each region corresponds to a branch of a hierarchical contour tree decomposition, and a separate transfer function can be defined for it. The novel contributions of our work are: 1) a volume rendering framework and interface where a unique transfer function can be assigned to each subvolume corresponding to a branch of the contour tree, 2) a runtime method for adjusting data values to reflect contour tree simplifications, 3) an efficient way of mapping a spatial location into the contour tree to determine the applicable transfer function, and 4) an algorithm for hardware-accelerated direct volume rendering that visualizes the contour tree-based segmentation at interactive frame rates using graphics processing units (GPUs) that support loops and conditional branches in fragment programs     

Fast Isosurface Rendering on a GPU by Cell Rasterization

This paper presents a fast, high‐quality, GPU‐based isosurface rendering pipeline for implicit surfaces defined by a regular volumetric grid. GPUs are designed primarily for use with polygonal primitives, rather than volume primitives, but here we directly treat each volume cell as a single rendering primitive by designing a vertex program and fragment program on a commodity GPU. Compared with previous raycasting methods, ours has a more effective memory footprint (cache locality) and better coherence between multiple parallel SIMD processors. Furthermore, we extend and speed up our approach by introducing a new view‐dependent sorting algorithm to take advantage of the early‐z‐culling feature of the GPU to gain significant performance speed‐up. As another advantage, this sorting algorithm makes multiple transparent isosurfaces rendering available almost for free. Finally, we demonstrate the effectiveness and quality of our techniques in several real‐time rendering scenarios and include analysis and comparisons with previous work.     

Web-Based Remote Renderingwith IBRAC (Image-Based Rendering Acceleration and Compression)

Recent advances in Internet and computer graphics stimulate intensive use and development of 3D graphics on the World Wide Web. To increase efficiency of systems using 3D graphics on the web, the presented method utilizes previously rendered and transmitted images to accelerate the rendering and compression of new synthetic scene images. The algorithm employs ray casting and epipolar constraints to exploit spatial and temporal coherence between the current and previously rendered images. The reprojection of color and visibility data accelerates the computation of new images. The rendering method intrinsically computes a residual image, based on a user specified error tolerance that balances image quality against computation time and bandwidth. Encoding and decoding uses the same algorithm, so the transmitted residual image consists only of significant data without addresses or offsets. We measure rendering speed-ups of four to seven without visible degradation. Compression ratios per frame are a factor of two to ten better than MPEG2 in our test cases. There is no transmission of 3D scene data to delay the first image. The efficiency of the server and client generally increases with scene complexity or data size since the rendering time is predominantly a function of image size. This approach is attractive for remote rendering applications such as web-based scientific visualization where a client system may be a relatively low-performance machine and limited network bandwidth makes transmission of large 3D data impractical.