非平均化自适应Catmull-Clark细分算法

提出一种基于网格边的光滑度计算来进行Catmull-Clark自适应细分的新算法。该方法能够在满足显示需求的前提下较好地减小细分曲面过程中的网格生成数,同时解决了由于采用网格顶点曲率计算,来实现自适应细分方法中平均化生成顶点曲率带来的不足。通过对比试验,算法能更好地区别当前细分网格中光滑与非光滑区域,增加对非光滑区域网格加密密度,并且该算法能够普遍适用于较复杂的细分模式中,具有一定的推广价值。     

基于蝶形细分自适应算法的三维地形仿真

基于格网法提出了蝶形细分自适应算法进行三维地形模拟,以原网格顶点的法向量为约束条件,通过对初始三角形控制网格进行多阶曲线迭代插值的非静态细分,实现几何造型.插值点的计算依据网格的局部几何特征,根据三角形网格上顶点的平坦度进行有选择性的自适应细分,同时对细分过程中产生的曲面裂缝加以弥补.地形仿真实例显示新的自适应细分方法可以很好地继承原始网格的形状特征,在曲面的光滑度和真实性上更加完善,加快了图形处理的速度.     

误差可控的细分曲面图像矢量化EI北大核心CSCD

为了提高矢量化图像的重构质量,提出一种基于细分曲面的误差可控矢量化算法.首先提取图像特征,构建特征约束的初始网格,并利用二次误差度量方法简化初始网格,得到特征保持的基网格;然后利用带尖锐特征的Loop细分曲面拟合图像颜色,得到控制网格;最后计算重构图像的误差,对控制网格进行自适应细分,直至重构误差达到用户需求.实验结果表明,该算法能够大幅度提高初始重构结果的质量,并在一定程度上做到误差可控.     

误差可控的细分曲面图像矢量化

为了提高矢量化图像的重构质量,提出一种基于细分曲面的误差可控矢量化算法.首先提取图像特征,构建特征约束的初始网格,并利用二次误差度量方法简化初始网格,得到特征保持的基网格;然后利用带尖锐特征的Loop细分曲面拟合图像颜色,得到控制网格;最后计算重构图像的误差,对控制网格进行自适应细分,直至重构误差达到用户需求.实验结果表明,该算法能够大幅度提高初始重构结果的质量,并在一定程度上做到误差可控.     

细分曲面拟合的局部渐进插值方法

逼近型细分方法生成的细分曲面其品质要优于插值型细分方法生成的细分曲面.然而,逼近型细分方法生成的细分曲面不能插值于初始控制网格顶点.为使逼近型细分曲面具有插值能力,一般通过求解全局线性方程组,使其插值于网格顶点.当网格顶点较多时,求解线性方程组的计算量很大,因此,难以处理稠密网格.与此不同,在不直接求解线性方程组的情况下,渐进插值方法通过迭代调整控制网格顶点,最终达到插值的效果.渐进插值方法可以处理稠密的任意拓扑网格,生成插值于初始网格顶点的光滑细分曲面.并且经证明,逼近型细分曲面渐进插值具有局部性质,也就是迭代调整初始网格的若干控制顶点,且保持剩余顶点不变,最终生成的极限细分曲面仍插值于初始网格中被调整的那些顶点.这种局部渐进插值性质给形状控制带来了更多的灵活性,并且使得自适应拟合成为可能.实验结果验证了局部渐进插值的形状控制以及自适应拟合能力.     

Catmull-Clark细分网格数据点拾取

针对将OpenGL选择拾取机制直接作用于Catmull-Clark细分网格数据点的拾取,可能会因细分网格数据量过大而导致名字堆栈溢出的问题,借鉴细分曲面求交的思想,提出一种新的细分网格数据点拾取方法.该方法通过提取拾取对象的邻域网格并进行局部细分,将对细分任意层次上网格数据点的拾取转化为对初始控制网格以及在达到细分层次要求以前每一次局部细分网格点、边、面的拾取和对最后一次局部细分网格数据点的拾取.采用多个拾取算例进行对比分析实验,当细分网格顶点数量较多时,所给拾取方法的拾取命名对象总量和拾取时间都远小于传统OpenGL选择拾取方法.实验结果表明,所给拾取方法能快速准确实现细分网格数据点的拾取,尤其适用于数据量较大的复杂细分模型,可有效避免因拾取名字堆栈溢出而导致的拾取错误.     

基于二次误差的三角网格自适应细分算法研究

提出一种基于二次误差的三角网格自适应细分算法,该算法采用二次误差描述三角网格的曲率变化情况,只对二次误差大于阈值的三角面片进行细分,避免了在较平坦区域再进行细分,以较少的三角面片表达了模型的特征,实现三角网格的自适应细分.与全局细分相比,自适应细分既可增加模型光顺性,又可减少模型的数据处理量,提高细分效率.     

三角网格的自适应细分研究

提出面向三角网格全局细分和局部自适应的细分算法。在原三角网格模型上计算每个面片的中心坐标,据此生成的中心坐标点作为新的顶点坐标进行重新绘制得到三角基网格,然后进行多次迭代,达到基本的全局细分目标。在最后生成的基网格上,可以通过调节最大网格面积和平均网格面积之间的比例系数等,来得到更加均匀的三角网格。实验表明该方法能到得到质量较高的细分结果。     

三角网格顶点重要度的自适应Loop细分算法

提出了一种新的自适应细分算法,在顶点的1-邻域内,用与顶点相连较长三条边的端点构成的平面去替代其平均平面,将顶点到其平均平面的距离作为判断顶点重要度的标准,对三角网格进行自适应细分。由于原始三角面片的高密度和形状相似性,以点面距离为细分尺度所产生的误差,可被限制在一个体元之内,与反复修正顶点法矢算法相比,该算法大大减少了计算量。实验结果表明,所提方法在三角网格细分过程中,简化了数据模型,提高了处理速度。     

用Catmull-Clark细分及网格调整方法重构牙齿曲面

首先根据牙齿表面测量数据点,计算出其长方体包围盒;并据此构造细分曲面的初始网格;采用矩阵对角化方法,推导Catmull-Clark细分极限点的表达式,计算初始网格的顶点经过细分后的极限点;按照极限点逼近数据点的原则移动控制网格顶点,经过逐次再细分、再调整网格,使各级网格在数据点的“引导”下逐步变形,使网格逐步逼近牙齿表面的测量数据点集合,实现牙齿表面模型的三维重建。     

Data‐driven projection method in fluid simulation

Physically based fluid simulation requires much time in numerical calculation to solve Navier–Stokes equations. Especially in grid‐based fluid simulation, because of iterative computation, the projection step is much more time‐consuming than other steps. In this paper, we propose a novel data‐driven projection method using an artificial neural network to avoid iterative computation. Once the grid resolution is decided, our data‐driven method could obtain projection results in relatively constant time per grid cell, which is independent of scene complexity. Experimental results demonstrated that our data‐driven method drastically speeded up the computation in the projection step. With the growth of grid resolution, the speed‐up would increase strikingly. In addition, our method is still applicable in different fluid scenes with some alterations, when computational cost is more important than physical accuracy. Copyright © 2016 John Wiley & Sons, Ltd.     

任意三维物体FDTD共形网格生成算法

时域有限差分法(FDTD)是计算电磁学广泛使用的方法之一.作为一种数值方法,首先要对目标模型进行网格离散.它直接影响到计算的精确性与复杂性.为了避免采用Yee氏单元对复杂模型建模所产生的阶梯误差,实现了一种任意复杂形状三维物体FDTD共形网格自动生成算法.对于由AutoCAD等建模软件生成的目标模型(三角形和四边形构成),应用计算机图形学方法求出网格线与模型的交点,在三个网格面分别生成共肜网格.数值结果证实了共形网格生成方法的正确性和在提高FDTD方法计算精度方面的有效性.     

一个偏微分方程计算的新平台-UG

UG(UnstructuredGrids)是近几年成熟起来的一个计算偏微分方程的软件平台。它实现了二维、三维非结构网格的自适应局部加密,结合了多层网格计算方法,具有串行程序向并行程序平滑过渡的特点,是数值仿真和数值算法研究的有利工具。论文简要介绍了该软件的一般情况,着重分析了软件的基本数据结构、多层网格思想和并行机制,并对UG在我国的应用进行了展望。     

A novel hybrid algorithm based on FDTD and WCS‐FDTD methods

In this article, a hybrid algorithm based on traditional finite‐difference time‐domain (FDTD) and weakly conditionally stable finite‐difference time‐domain (WCS‐FDTD) algorithm is proposed. In this algorithm, the calculation domain is divided into fine‐grid region and coarse‐grid region. The traditional FDTD method is used to calculate the field value in the coarse‐grid region, while the WCS‐FDTD method is used in the fine‐grid region. The spatial interpolation scheme is applied to the interface of the coarse grid region and fine grid region to insure the stability and precision of the presented hybrid algorithm. As a result, a relatively large time step size, which is only determined by the spatial cell sizes in the coarse grid region, is applied to the entire calculation domain. This scheme yields a significant reduction both of computation time and memory requirement in comparison with the conventional FDTD method and WCS‐FDTD method, which are validated by using numerical results.     

Finite Difference Method for the Black–Scholes Equation Without Boundary Conditions

We present an accurate and efficient finite difference method for solving the Black–Scholes (BS) equation without boundary conditions. The BS equation is a backward parabolic partial differential equation for financial option pricing and hedging. When we solve the BS equation numerically, we typically need an artificial far-field boundary condition such as the Dirichlet, Neumann, linearity, or partial differential equation boundary condition. However, in this paper, we propose an explicit finite difference scheme which does not use a far-field boundary condition to solve the BS equation numerically. The main idea of the proposed method is that we reduce one or two computational grid points and only compute the updated numerical solution on that new grid points at each time step. By using this approach, we do not need a boundary condition. This procedure works because option pricing and computation of the Greeks use the values at a couple of grid points neighboring an interesting spot. To demonstrate the efficiency and accuracy of the new algorithm, we perform the numerical experiments such as pricing and computation of the Greeks of the vanilla call, cash-or-nothing, power, and powered options. The computational results show excellent agreement with analytical solutions.     

Vector coding the finite-volume procedure for the CYBER 205

The paper reviews a method for the large-scale numerical simulation of fluid flow and discusses fundamental principles of vector programming in FORTRAN in order to set the stage for the main topic, the vector coding and execution of the finite-volume procedure on the CYBER 205. With the proper structure given to the data by the grid transformation each coordinate direction can be differenced throughout the entire grid in one vector operation. Boundary conditions must be interleaved which tends to inhibit the concurrency of the overall scheme, but a stragey of no data motion together with only inner-loop vectorization is judged to be the best compromise. The computed example of transonic vortex flow separating from the sharp leading edge of a delta wing demonstrates the processing performance of the procedure. Vectors over 40000 elements long are obtained, and a rate of over 125 megaflops sustained over the entire computation indicates the high degree of vectorization achieved.     

加快反投影算法重建PET图像的研究

对反投影的计算方法进行了改进,设计了一种能够提高反投影速度的方法。使用这种方法,对模型数据进行了重建,结果表明,这种方法对图像质量的影响很小。由于实际PET的投影数据中的噪声相对较大,并且,在滤波反投影算法中的重建滤波器对重建图像的高频噪声有某种放大作用,针对这个问题,利用临床PET数据,从投影数据预处理、利用窗函数控制噪声两个方面进行了研究。     

基于网格的计算化学过程可视化*

提出了一个基于网格的计算化学过程可视化解决方案,实时地监控计算过程,增加对计算过程的控制。网格提供了计算作业所需要的大量计算资源,对计算过程的实时监控则增加了对计算过程的控制。为了达到实时的目的,针对计算过程中的原子不变性,提出了优化的三维可视化方法,动态地设定检测的时间间隔,并引入了断点续传的思想。     

ℓ2 Gain Estimation and Visualization of A Control Parameter Set in 3D Space Using Plant Response Data

In this paper, a novel parameter space approach that uses volume rendering is proposed to visualize controller parameter sets that consist of three controller parameters. An off‐line design method for robust control using plant response data is also studied. A solution set with equal ?₂ gain can be visualized as isosurfaces in three‐dimensional space, and the designer can visually select an appropriate parameter. This numerical method is applicable to many practical specifications, in contrast to analytical methods based on solving equations. An estimation method based on the extension theorem and a method using bandpass filters are both considered as possible methods for estimating the ?₂ gain of the sensitivity functions when using grid points on the order of tens of thousands to create the volume data.The former method is superior to the latter with respect to accuracy but impractical with respect to computational load. The latter method is hence practical, because the computing time is reduced to less than 0.05 s for about 300,000 grid points by parallel computation with a graphical processing unit.     

A parallel viscous flow solver on multi-block overset grids

A multi-block overset grid method is presented to accurately simulate viscous flows around complex configurations. A combination of multi-block and overlapping grids is used to discretize the flow domain. A hierarchical grid system with layers of grids of varying resolution is developed to ensure inter-grid connectivity within a framework suitable for multi-grid and parallel computations. At each stage of the numerical computation, information is exchanged between neighboring blocks across either or both matched block boundaries and overlapping boundaries. Coarse-grain parallel processing is facilitated by the multi-block system. Numerical results of flows over multi-element airfoils and three-dimensional turbulent flows around wing–body aerodynamic configurations demonstrate the utility and efficiency of the method.