脉动风场中的飘雪模拟

飘雪场景的模拟可以大大提高虚拟场景的逼真效果,其中风场的建模是重要的环节.为更真实的表现风的随机性,本文基于格子BGK建立风场,用D3Q7模型改进三维风场的建模方法,引入湍流强度的概念描述风场的湍流程度,根据地表面的粗糙程度和离地高度确定其大小,实验表明该方法能更好的增强模拟风场中飘雪场景的真实性.     

基于周期性晶格的3D打印模型轻量化方法

为了获得 3D 打印模型节材效果和优化的物理力学性能,从晶格的形状多变性出发,提出了一 种基于晶格的 3D 打印轻量化结构生成方法,由此产生的轻量化结构用来替代给定模型的实体空间。首先,提 出了一种通用的晶格描述方法,进而对晶格的几何和拓扑特征进行个性化设计。其次,通过在模型包围盒内周 期性排列晶格单元,构造出了实体建模所依附的拓扑骨架结构。接着,采用了一种基于网格拼接的直接构建 STL 模型的几何建模方法,其无需布尔运算即能快速获得网格质量可控的晶格实体结构。通过实物打印验证了 适用于晶格结构的 3D 打印成型工艺。对 5 种典型晶格的几何和力学特性进行了对比分析,并作为晶格设计选 用的初步依据。结果证明,该方法在实现节材和提高模型强重比的同时,达到了保证轻量化模型的可打印性、 自平衡性以及力学性能可优化等目标。相较于以往的方法,具有多变性和效率优势,适合各种工程应用。     

飘雪场景的实时模拟

自然景物的真实感模拟一直是计算机图形学中的一个富有挑战性的课题，而飘雪场景的实时模拟尤为困难。因为它涉及到复杂的风场建模和风雪的交互作用．在充分考虑风雪具体物理特性的基础上，通过对经典Boltzmann 方程进行离散来构造三维风场，并根据风雪的交互作用规律，建立起雪的飘动、沉积、侵蚀等变化规则，进一步采用一系列简化和加速绘制的方法，具有真实感地实时绘制出不同风速下不同降雪量的风雪场景．     

基于粒子系统的飘雪场景实时绘制

为了实现真实感飘雪场景特效,提出基于GPU加速的飘雪场景实时绘制方法。飘雪场景作为自然环境特效的一部分,一直是虚拟现实领域研究的难点。详细阐述基于GPU加速的飘雪场景实时绘制方法,包括雪粒子的产生、初始化、属性更新、沉积计算、消亡、绘制等过程。给出实验结果与分析,包括飘雪场景、飘雪效果、飘雪沉积等实验。实验证明,该方法是可行有效的。     

MgCu_2型Laves相晶格常数的规律性

根据Miedema的合金元胞模型，用人工神经网络－原子参数方法总结MgCu2型Laves相晶格常数的规律性，从而提出一种计算Laves相晶格常数的方法。     

实时毛发建模和动画

提出了基于3D晶格的毛发机械模型和机械变形方法,表现毛发串的体行为,晶格被作为粒子系统采用数学计算变形.毛发机械模型被作为与晶格模型中的各单独头发串片段弹性相关的一系列线性黏弹性晶格弹簧定义.发型足以快速实时表现,同时保留了毛发的特定行为,获得足够的多样性模拟各种复杂发型.用多项式元球模型处理毛发和身体表面之间碰撞.毛发模型具有很高的实时性能和通用性,可达到准确性和计算速度之间的最佳折中.     

MgCu2型Laves相晶常数的规律性

根据Ｍｉｅｄｅｍａ的合金元胞模型，用人工神经网络－原子参数方法总结ＭｇＣｕ２型Ｌａｖｅｓ相晶格常数的规律性，从而提出一种计算Ｌａｖｅｓ相晶格常数的方法。     

支持嵌入式Web服务器的多层级力觉交互仿真

针对传统力觉交互操作过程复杂、模拟物理场景不真实的问题,提出支持嵌入式Web服务器的多层级力觉交互仿真研究方法.在嵌入式Web服务器的基础上添加离散LOD模型,计算相对交互速度,获得目标多层级的序列号进行碰撞计算,构建速度驱动模型.将碰撞检验离散速度驱动模型与SCP层级映射算法相结合,判定映射约束线段、映射约束包围盒单元,运用GHOST SDK计算二者的正交函数,确认满足模型的限制速度阈值条件,从而获得模型的速度参数值以及切换速度,完成力觉交互研究.仿真结果证明,所提方法可以有效解决力觉交互过程中出现的振动现象,提升场景真实感,并且计算简便,具有较高的稳定性与适用性.     

蛋白质折叠预测的禁忌搜索粒子群算法

针对PSO算法晚期收敛速度慢、求解精度差的缺点,提出了一种改进优化算法——将粒子群算法（Particle Swarm Optimization,PSO）与禁忌搜索算法（Tabu Search,TS）结合起来解决基于三维AB非晶格模型的蛋白质折叠预测问题。TS算法的引入提高了粒子群收敛后期的精度,粒子变异机制增强了粒子跳出局部极小值的能力。真实数据实验表明,该算法计算出的蛋白质序列能量值相比其他算法有更高的精确度,能够更好地模拟蛋白质构象,是分析蛋白质结构的一种有效方法。     

基于VRML和Java3D的虚拟漫游系统研究

采用3DSMAX对别墅场景进行建模,提出将VRML与Java3D相结合为该场景添加交互功能的方案;阐述了建模方法、用Java3D控制场景的方法和具体步骤,以及用LOD技术提高场景漫游速度的方法;将Java Swing和Java3D结合构建用户平台.在该平台上实现了别墅场景的虚拟漫游.     

The Lattice-Boltzmann Method on Optimal Sampling Lattices

In this paper, we extend the single relaxation time Lattice-Boltzmann Method (LBM) to the 3D body-centered cubic (BCC) lattice. We show that the D3bQ15 lattice defined by a 15 neighborhood connectivity of the BCC lattice is not only capable of more accurately discretizing the velocity space of the continuous Boltzmann equation as compared to the D3Q15 Cartesian lattice, it also achieves a comparable spatial discretization with 30 percent less samples. We validate the accuracy of our proposed lattice by investigating its performance on the 3D lid-driven cavity flow problem and show that the D3bQ15 lattice offers significant cost savings while maintaining a comparable accuracy. We demonstrate the efficiency of our method and the impact on graphics and visualization techniques via the application of line-integral convolution on 2D slices as well as the extraction of streamlines of the 3D flow. We further study the benefits of our proposed lattice by applying it to the problem of simulating smoke and show that the D3bQ15 lattice yields more detail and turbulence at a reduced computational cost.     

Three-dimensional discrete-velocity BGK model for the incompressible Navier–Stokes equations

The lattice Boltzmann method (LBM) has been widely used for the simulations of the incompressible Navier–Stokes (NS) equations. The finite difference Boltzmann method (FDBM) in which the discrete-velocity Boltzmann equation is solved instead of the lattice Boltzmann equation has also been applied as an alternative method for simulating the incompressible flows. The particle velocities of the FDBM can be selected independently from the lattice configuration. In this paper, taking account of this advantage, we present the discrete velocity Boltzmann equation that has a minimum set of the particle velocities with the lattice Bharnagar–Gross–Krook (BGK) model for the three-dimensional incompressible NS equations. To recover incompressible NS equations, tensors of the particle velocities have to be isotropic up to the fifth rank. Thus, we propose to apply the icosahedral vectors that have 13 degrees of freedom to the particle velocity distributions. Validity of the proposed model (D3Q13BGK) is confirmed by numerical simulations of the shear-wave decay problem and the Taylor–Green vortex problem. With respect to numerical accuracy, computational efficiency and numerical stability, we compare the proposed model with the conventional lattice BGK models (D3Q15, D3Q19 and D3Q27) and the multiple-relaxation-time (MRT) model (D3Q13MRT) that has the same degrees of freedom as our proposal. The comparisons show that the compressibility error of the proposed model is approximately double that of the conventional lattice BGK models, but the computational efficiency of the proposed model is superior to that of the others. The linear stability of the proposed model is also superior to that of the lattice BGK models. However, in non-linear simulations, the proposed model tends to be less stable than the others.     

Migrating multi-block lattice Boltzmann model for immiscible mixtures: 3D algorithm development and validation

The lattice Boltzmann method (LBM) has emerged as a powerful numerical fluid solver especially in the areas of multi-component and multi-phase mixtures. However the LBM uses the particle velocity for the determination of the model time step required by the Courant-Friedrichs-Lewy (CFL) stability condition. This degrades the LBM efficiency, when compared with standard CFD solvers which use instead the macroscopic velocity for the CFL requirements. This paper discusses the development and validation of a 3D migrating multi-block model aiming at the acceleration of the LBM solution. The proposed algorithm is especially applicable to the Gunstensen multi-component model, in which a fine grid block engulfs the fluid-fluid interface and migrates with it. This increases the efficiency of the LBM since less iteration steps are required in areas of marginal interest, and it enables a better interface resolution because the fluid interface is always covered with finer grid. The method was demonstrated by simulating the case of a 3D rising bubble in infinite medium, in which the model results for the bubble terminal velocity were in good agreement with a semi-analytical solution, and the produced shapes fitted very well an experimental shape regime map.     

二维概念格图形的三维重构研究

介绍了二维概念格图形向三维空间转化和延伸的必要性和现状。通过对传统概念格图形分层定位布局方法的研究与分析,提出并实现了一种新的以具有大量的平行四边形和有向线段为基本特征的概念格在三维空间的自动布局算法,描述了一种基于该算法的二维概念格图形的三维重构机制,有效地解决了节点横向过度扩张的问题并减少了线段交叉,较好地实现了复杂概念格图形的三维可视化,为知识发现和知识处理提供了良好的基础。     

Efficient LBM Visual Simulation on Face-Centered Cubic Lattices

The Lattice Boltzmann method (LBM) for visual simulation of fluid flow generally employs cubic Cartesian (CC) lattices such as the D3Q13 and D3Q19 lattices for the particle transport. However, the CC lattices lead to suboptimal representation of the simulation space. We introduce the face-centered cubic (FCC) lattice, fD3Q13, for LBM simulations. Compared to the CC lattices, the fD3Q13 lattice creates a more isotropic sampling of the simulation domain and its single lattice speed (i.e., link length) simplifies the computations and data storage. Furthermore, the fD3Q13 lattice can be decomposed into two independent interleaved lattices, one of which can be discarded, which doubles the simulation speed. The resulting LBM simulation can be efficiently mapped to the GPU, further increasing the computational performance. We show the numerical advantages of the FCC lattice on channeled flow in 2D and the flow-past-a-sphere benchmark in 3D. In both cases, the comparison is against the corresponding CC lattices using the analytical solutions for the systems as well as velocity field visualizations. We also demonstrate the performance advantages of the fD3Q13 lattice for interactive simulation and rendering of hot smoke in an urban environment using thermal LBM.     

Multidimensional upwind scheme of diagonal Cartesian method for an advection-diffusion problem

The natural calculation region in fluid dynamics involves complex boundaries. When using the Cartesian grid to approximate complex boundaries, two difficulties develop: the boundary zigzag effect and disagreement of direction of grid line and velocity. The multidimensional upwind scheme of the diagonal Cartesian method (DCM), using both Cartesian grid lines and diagonal lines segments, is presented in this paper to simulate the complex boundaries of the multiple-layer quasi 3D model equations. The DCM improves the simulation accuracy for the boundaries and calculation time increases only slightly compared to the Cartesian method. In order to verify the new scheme, a test case is presented which rotates the cavity flow at 45° to compare the numerical calculation results at different Reynolds numbers. The test case shows that the scheme is accurate and efficient in improving the simulation results. Then the three-dimensional advection-diffusion processes in the tidal water of the Hongyanhe Power Plant are simulated using this model. Numerical results show that the scheme is not only efficient on an experiment basis, but also efficient and reliable when applied to a large scale natural water area.     

Lattice-based volumetric global illumination

We describe a novel volumetric global illumination framework based on the Face-Centered Cubic (FCC) lattice. An FCC lattice has important advantages over a Cartesian lattice. It has higher packing density in the frequency domain, which translates to better sampling efficiency. Furthermore, it has the maximal possible kissing number (equivalent to the number of nearest neighbors of each site), which provides optimal 3D angular discretization among all lattices. We employ a new two-pass (illumination and rendering) global illumination scheme on an FCC lattice. This scheme exploits the angular discretization to greatly simplify the computation in multiple scattering and to minimize illumination information storage. The GPU has been utilized to further accelerate the rendering stage. We demonstrate our new framework with participating media and volume rendering with multiple scattering, where both are significantly faster than traditional techniques with comparable quality.     

An improved immersed boundary method for curvilinear grids

In the present paper we propose an extension of the direct-forcing immersed boundary technique, recently developed and employed by Verzicco and co-authors [Fadlun EA, Verzicco R, Orlandi P, Mohd-Yusof J. Combined immersed-boundary finite-difference methods for three-dimensional complex flow simulations. J Comput Phys 2000;161:35–60; Verzicco R, Fatica M, Iaccarino G, Moin P, Khalighi B. Large eddy simulation of a road vehicle with drag-reduction devices. AIAA J 2002;40(12):2447–55; Cristallo A, Verzicco R. Combined immersed boundary/large-eddy-simulations of incompressible three-dimensional complex flows. Flow Turbul Combust 2006;77(1–4):3–26.] and successively improved by Balaras and co-authors [Gilmanov A, Sotiropoulos F, Balaras E. A general reconstruction algorithm for simulating flows with complex 3D immersed boundaries on Cartesian grids. J Comput Phys 2003;191:660–9; Balaras E. Modeling complex boundaries using an external force field on fixed Cartesian grids in large-eddy simulations. Comput Fluids 2004;33:375–404]. We extend the aforementioned technique to curvilinear-coordinate, structured grid, Navier–Stokes solvers. This improved technique allows for more flexibility and efficiency when compared to standard methods in which the technique is coupled with orthogonal-grid solvers. Additional modifications are also proposed with respect to the state-of-art, which allow to deal with general shaped, multiple-body immersed surfaces and to make the interpolation of the velocity field off the body suitable for curvilinear grids. Several tests have been carried out to check the reliability of the proposed technique: first we have considered the three-dimensional Stokes flow around a sphere, and compared the numerical results with the analytical ones. Second we have considered the two-dimensional unsteady flow around a circular cylinder placed between two parallel solid walls and compared the results with those of the database of the Priority Research Program ‘Flow Simulation on High Performance Computers’ of the German Research Association (DFG). Third, we have considered the two-dimensional flow within a S-shaped duct containing an elliptical valve. Finally, we have applied the technique to the study of a practical high-Reynolds number industrial problem.The geometrical configuration of the first two test cases is suited for both Cartesian and curvilinear algorithms. The geometry of the third test case is suited for curvilinear meshes and makes the use of Cartesian grids very inefficient and less accurate than the curvilinear ones. In these cases Cartesian – as well as curvilinear – mesh simulations have been carried out. Finally, the geometry of the high-Reynolds industrial problem is suited for curvilinear grids.The proposed technique has shown to preserve at least the same level of accuracy of its Cartesian counterpart allowing to reduce in a considerable way the computational cost of the simulations. When the geometry is better suited for curvilinear meshes, the reduction of the computational cost is accompanied by an increased accuracy with respect to the Cartesian counterpart.We also propose a simplified direct-forcing, semi-implicit method, allowing reduced computational cost with respect to the literature techniques. We have checked the accuracy of the technique and shown that when the Reynolds number is large enough, the present simplified technique allows the use of time steps much larger than those allowed by the explicit time-advancement scheme, preserving the accuracy of the results.     

Dispersion analysis and computational efficiency of elastic lattice methods for seismic wave propagation

Discrete particle methods or elastic lattice methods represent a 3D elastic solid by a series of interconnected springs arranged on a regular lattice. Generally, these methods only consider nearest neighbour interactions, i.e. they are first-order in space. These interconnected springs interacted through a force term (Hooke's Law for an elastic body), which when viewed on a macroscopic scale provide a numerical solution for the elastodynamic wave equations. Along with solving the elastodynamic wave equations these schemes are capable of simulating elastic static deformation. However, as these methods rely on nearest neighbour interactions they suffer from more pronounced numerical dispersion than traditional continuum methods. By including a new force term, the numerical dispersion can be reduced while keeping the flexibility of the nearest neighbour interaction rule. We present results of simulations where the additional force term reduces the numerical dispersion and increases the accuracy of the elastic lattice method solution. The computational efficiency and parallel scaling of this method on multiple processors is compared with a finite-difference solution to assess the computational cost of using this approach for simulating seismic wave propagation. We also show the applicability of this method to modelling seismic propagation in a complex Earth model.