基于CUDA架构的改进Marching Cubes算法

Marching Cubes是医学体数据可视化的经典算法,但生产的网格质量差、算法执行速度慢成为阻碍其用于数值分析的两个主要缺点。文中提出一种基于硬件加速的Marching Cubes改进算法。该算法采用统一设备架构(CUDA)充分发挥Marching Cubes算法分而治之的优点,利用CUDA的可编程性并行分类体数据,加快了活跃体素和活跃边的提取;同时,该改进算法将得到的活跃边按照中点投影方式进行偏移,从而达到了改善网格质量的目的。最后通过实验表明,该算法可以保证在阈值未知的情况下,进行交互式的高质量网格建模。     

颅颌面三维重建与网格简化的研究

三维网格简化是十分有意义的研究问题.研究中首先搭建了一个颅颌面CT切片图像三维重构系统.其次,在网格模型顶点删除算法的基础上,提出一种新的三角化所用判据.实验结果表明,应用这一判据,在避免了原算法通过迭代步骤完成三角化的不必要的大量计算的同时,简化模型与原算法结果属同一数量级别,在视觉上无显著差异.     

医学图像重建MC算法三角片的合并与实现

提出一种算法对Marching Cubes算法中产生的大量三角片进行合并。根据三角片顶点的空间位置,按照所给的约束条件对顶点进行判断,合并符合条件的顶点,以减少三角片的数目。这个方法在保留图像细节的前提下,改善影像的显示速度,以期实现三维医学图像实时显示。对数据量大的医学图像的三维重建尤为必要。     

基于近平面合并的三角网格简化算法

提出一种基于近平面合并的三角网格简化算法,针对三维重建MarchingCubes算法中产生的大量三角片进行简化。首先依据近平面判断条件将近似共面的三角形合并成一个大的多边形,然后按相应的准则将其重新进行三角化得到更少的三角形面片,以达到简化的目的。该算法在最大化的保留图像细节的前提下,精简了三角片的数目,提高了重建后图像绘制和传输的速率,节省了存储空间和处理时间。     

乳腺MRI图像肿块分割的分段比较与方法研究

计算机辅助诊断通过对乳腺磁共振成像( MRI)中肿块区域的自动分割和测量为医生提供定量的诊断依据。对分割过程中不同阶段的多种算法进行实验对比,以此探索更具稳定性和准确性的分割方案：空间模糊C均值( sFCM)聚类算法在肿块的初始定位中具有抗噪声能力和稳定性强的优点,而GVF snake模型在精细分割中对局部轮廓具有较好的收敛性;结合两种算法,并运用MRI序列帧间灰度分布相似、肿块位置/形状相近的原理,最终提高整个序列的分割精度与稳定性。     

基于Marching Cubes重组的外存模型渐进压缩

外存模型是指其规模远远超出内存容量的海量模型．为提高其存储、传输、显示等操作的效率,对外存模型进行渐进式的压缩是非常重要的．但当前已有的外存模型压缩算法都是单一层次的,不能做到渐进压缩．为此,该文提出一种针对外存模型的渐进压缩方法．能高效地压缩外存模型,并进行多分辨率的传输和显示．该方法首先将外存模型的包围盒空间按照八叉树形式进行剖分和层次化组织,使得最精细层次的各个立方块空间中的局部模型都能完全装入内存进行处理;然后,在各个立方块中对局部的模型进行基于Marching Cubes方式的重新拟合,并在此基础上建立各个局部的自适应八叉树;最后,基于各个局部自适应的八叉树,由粗至细渐进地遍历全局自适应八叉树的各个节点,并利用对内存模型能高效渐进压缩编码的先进方法进行编码压缩．实验表明,该方法对外存模型的压缩比达到了与处理内存模型相似的压缩比．高于目前的外存模型压缩方法,是第一个能渐进压缩外存模型的方法．     

基于气象雷达回波3D重建的Marching Cubes改进算法

根据气象雷达回波数据的三维极坐标分布特点,提出一种改进的Marching Cubes三维重建算法.该算法将Marching Cubes常规算法中的单位正立方体构建转换为直接对回波极坐标数据的拟柱体构建,生成相应的等值三角面,并对三角面的顶点数据进行地曲订正,供OpenGL显示.为进一步提高重建算法的效率,该算法避免了对高仰角远距离无回波区的重建.实验表明,该算法有效实现了雷达回波的三维重建.     

基于最近邻Marching Cubes的医学图像三维重建

在医学图像三维可视化中,移动立方体算法（Marching Cubes,MC）是面绘制的经典算法。针对MC算法计算插值点导致执行速度慢、效率不高的缺点,提出一种基于最近邻逼近的MC算法,该方法在n次等分点量化序列中寻找等值面最近邻点代替线性或非线性插值,既避免了插值的大量计算又保证了误差精度,还可改善三角面片结构。利用可视化工具开发包VTK对人体脸部和脚部CT数据集进行三维重建,实验表明改进算法明显缩短了绘制时间,提高了重建效率。     

基于图像分割的三维重构

三维重构方法是医学图像可视化系统、治疗计划系统的重要技术。基于图像分割的三维重构方法结合了图像分割、等值面抽取、网格简化三种技术,是不同于传统Marching Cubes算法的一种三维重构方法。它首先将医学图像分割为二值图,然后利用Marching Cubes方法进行等值面抽取,最后对得到的网格模型进行简化。实验结果表明,基于图像分割的三维重构方法加快了Marching Cubes的运算速度,改善了重构的效果,有利于实现对基于三维重构的大型几何模型的实时绘制和交互。     

面绘制三维重建原理及其改进算法研究

Marching Cubes(MC)算法是经典的面绘制算法,但它存在数据源复杂、分割方法单一和三维网格存储量大的问题.针对这种情况,提出了改进策略,主要是从图像预处理、图像分割及三角形网格简化方面加以讨论,并给出了相应的算法,由此使得重建算法的数据源信息更准确,适用面更广,存储效率更高.     

复杂场景中动态简化层次的构造

多细节层次描述（简称ＬｏＤ）是实时绘制复杂几何场景的一种有效工具。基于层次结构的动态简化方法能够根据视点的变化,实时连续地转换场景细节模型。本文提出了一种改进的动态网格简化框架,它利用顶点映射机制支持不同细节层次之间的快速连续转换,同时还给出了建立和维护复杂场景动态简化层次结构的方法。     

一种新型渐进网格在多模型显示中的应用

为了解决传统方法在渲染多模型时通常出现的一些例如内存过度消耗甚至超出系统内存以及显示的帧数率过低等问题,提出了一种新型渐进网格的实现方法。该方法独立于简化算法,通过分解渐进网格的基本操作,尽量省去不必要的数据结构和操作从而使空间复杂性和时间复杂性都有明显的改进。为实际工程应用提出了一种简单的多模型显示框架;实验表明这种以新型渐进网格实现为基础的框架在多模型显示的场景下具有很好的应用价值。     

基于法向的网格简化

网格简化是科学计算可视化和虚拟现实领域中的一个重要研究方面,它在不严重损失物体的视觉特征的前提下,用较少数目的多边来表示物体,减少了模型的复杂性,提高了绘制的速度,文中提出了一个适合于表面曲率变化不太大的网络简化算法。     

PAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programs

Graphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result. Testing mesh simplification implementations is essential to assure the quality of the graphics applications. However, it is very difficult to determine the oracles (or expected outcomes) of mesh simplification for the verification of test results.A reference model is an implementation closely related to the program under test. Is it possible to use such reference models as pseudo-oracles for testing mesh simplification programs? If so, how effective are they?This paper presents a fault-based pattern classification methodology called PAT, to address the questions. In PAT, we train the C4.5 classifier using black-box features of samples from a reference model and its fault-based versions, in order to test samples from the subject program. We evaluate PAT using four implementations of mesh simplification algorithms as reference models applied to 44 open-source three-dimensional polygonal models. Empirical results reveal that the use of a reference model as a pseudo-oracle is effective for testing the implementations of resembling mesh simplification algorithms. However, the results also show a tradeoff: When compared with a simple reference model, the use of a resembling but sophisticated reference model is more effective and accurate but less robust.     

Automatic reconstruction of B-spline surfaces with constrained boundaries

The aim of this study is to present an automatic surface reconstruction method that can take practical restrictions on scanned points into consideration and efficiently and reliably output a group of G¹ surfaces. The proposed method is mainly composed of three phases: quadrangle frame generation, point and curve networks planning, and surface patches reconstruction. In the first phase, the original triangle mesh is reduced and converted into a quadrangle mesh, the edges of which serve as the frame of the surfaces. In the second phase, the boundary data of the surfaces are prepared. These include a network of serial points, frame curves and surface normals which are also expressed as curves. In the final phase, surface initialization, harmonization mapping and surface warping are presented to yield the desired surfaces. The main advantage of the proposed method is that it can relax the pre-processing of a scanned triangle mesh, and hence, increase the efficiency and quality of the surface reconstruction. Several examples of various types of air bags are presented to demonstrate the feasibility of the proposed method.     

Consistent segmentation of 3D models

This paper proposes a method to segment a set of models consistently. The method simultaneously segments models and creates correspondences between segments. First, a graph is constructed whose nodes represent the faces of every mesh, and whose edges connect adjacent faces within a mesh and corresponding faces in different meshes. Second, a consistent segmentation is created by clustering this graph, allowing for outlier segments that are not present in every mesh. The method is demonstrated for several classes of objects and used for two applications: symmetric segmentation and segmentation transfer.     

一种大规模地形模型的视相关简化算法

提出了一种基于点删除的视相关简化算法。首先依据视锥准则、背离面准则和屏幕投影误差对原始网格进行可见性预处理,再对预处理后的网格依据顶点重要度大小进行点删除简化。重要度以顶点到平均平面的距离表示,在计算过程中,采用了距离加权的办法,从而进一步加强了视相关简化效果。实验表明,算法具有较高的绘制速度,并且绘制帧速率基本独立于模型的复杂度。     

User-assisted simplification method for triangle meshes preserving boundaries

This paper proposes a user-assisted mesh simplification method applied to CAD models converted to triangle meshes. This work offers the possibility of simplifying each subobject independently and at different levels of detail. This way, the user can simplify the whole model and then modify some parts, by simplifying more or by refining the desired subobjects. This can be performed while the total number of triangles in the simplified model is maintained. In this method any error metric based on an edge collapse operation can be used. Boundaries between subobjects are preserved and important attributes in the final aspect of simplified models, like normals and texture coordinates, are also considered.     

地形环境的视点相关模型构造及仿真

实时显示大尺度地形环境是环境是视觉仿真系统的需要,地形的精细程度与视点相关是解决绘制精度和速度的有效手段之一。该文根据视点相关模型的原理,分析了地形模型构造的一般算法,对模型简化过程中的合法性检测,数据结构和排序提出了改进方法,并在微机上进行了仿真,取得较好的效果。     

Simplification of composite parametric surface meshes

This paper concerns the simplification of composite parametric surface meshes which conform to the boundary of each constituting patch. The goal is to eliminate the small edges which result from this boundary patch preserving constraint, provided that these small edges belong to an almost flat area. To this end, two tolerance areas with respect to the initial reference mesh are introduced to keep close to the surface. The reference mesh is then simplified and optimized (in terms of shape quality) so that the resulting mesh belongs to these tolerance areas. Several examples of surface meshes are provided in order to assess the efficiency of the simplification method.