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

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

一种快速的三维有限元网格生成方法

针对三维有限元网格的生成的速度较慢并且网格质量不高的问题,提出了一种基于约束波前法的三维有限元网格生成算法。算法的主要思想是用背景网格提高网格单元的可控性,避免网格单元生成时验证有效性的计算量,从而快速生成高质量的三维有限元网格。算法首先借助八叉树方法生成背景网格,其次利用背景网格的密度对模型表面进行三角剖分得到初始波前,然后依据背景网格的特征生成实体网格单元,最后对得到的结果进行优化。实验证明结合了八叉树和推进波前法的三维网格生成算法降低了波前法的时间复杂度,将其效率提高了20%,而且能得到更高质量的网格。     

冲击爆炸问题的三维物质点法数值仿真

基于物质点法（Material Point Method,MPM）模拟超高速碰撞和爆炸问题时呈现的特点,概述对MPM及其应用的扩展,包括：将MPM扩展应用于超高速碰撞问题,物质点有限元法（MaterialPoint Finite Element Method,MPFEM）,杂交MPFEM,MPM质点自适应法,基于局部多重背景网格的接触算法和并行MPM算法.在此基础上开发针对冲击爆炸问题的三维显式并行MPM数值仿真软件MPM3D.MPM3D采用C＋＋语言开发,并基于Qt和VTK开发图形用户界面PeneBlast,可在Windows,Linux和Mac OS等多种平台上运行.关于超高速碰撞、侵彻、爆炸、边坡失效和金属切削等问题的大量实例表明MPM3D的可靠性和准确性.MPM3D可作为航天器空间碎片防护、常规武器研发与防护等的有效设计工具.     

基于距离场的三维模型网格重建

根据任意亏格和任意边界的3D网格模型,给出一种网格重建算法。该算法通过对原始网格进行一系列自适应的局部修改操作,改进网格中三角形的质量和顶点位置分布。为减少优化过程中误差的累积,提出基于距离场的算法将新生成的顶点保留到原始网格曲面上,该算法实现简单,不需要复杂的全局参数化操作。实验结果表明,该算法有效、快速、稳定。     

基于3dsMax/Unity3D的水平定向钻穿越工程应用

针对复杂地质结构下管道穿越和施工安全,综合分析国内外三维地质建模和虚拟现实可视化现状,提出基于3ds Max平台下的三维地质建模方法,完成水平定向钻穿越工程中复杂岩层地质模型的准确建立,实现岩层地质信息与穿越工程三维拓扑模型的数据映射。利用Unity3D开发引擎在虚拟现实仿真上的技术优势,基于Unity3D和Visual C#.NET开发环境完成三维地质场景的视点控制、穿越轨迹实时生成和数据管理,实现虚拟现实场景的实时展示与可视化交互。以江都-如东输气管道水平定向钻穿越工程为例,通过3ds Max创建三维地质场景,应用Unity3D平台虚拟可视化技术模拟输气管道穿越过程,为水平定向钻穿越工程的施工建设和规划管理提供参考。     

柱面坐标下基于OpenGL的非均匀FDTD网格的生成*

详细介绍了一种在柱面坐标系下非均匀FDTD(finite difference time domain,时域有限差分)网格的生成算法,并且利用OpenGL技术对其一维、二维、三维网格图形进行实现。一般地,使用传统方法进行三维图像的生成与消隐比较复杂,而采用OpenGL可以非常方便地对以上问题实现快速生成以及高效消隐。     

基于Java 3D的地球空间环境可视化研究

根据空间科学研究对交互性和Web化的发展需求,将Java 3D应用于该领域。深入剖析了Java 3D的主要几何类和实现细节;改进并实现了一种矩形网格等值线生成算法,解决了二义性和等值点在网格顶点的问题;介绍了一种生成规则网格的简单算法,并选用合适的Java 3D类加以实现;介绍了一种数值———颜色映射算法,并将空间环境数据映射为RGB颜色信息。综合运用这些算法,对地球空间环境中若干物理要素模型进行了二维和三维可视化。可视化结果与国内外空间环境模型研究成果基本一致,说明上述算法正确,有较高的参考价值。     

一种面向移动3D图形的几何简化方法

移动3D图形计算是无线网络和图形学高速发展产生的新研究领域.由于无线网络带宽和移动终端设备显示分辨率的限制,需要将3D图形进行分解压缩,依据不同的分辨率进行内容转码.提出了一种基于改进Loop细分的几何模型简化算法.一个稠密的几何网格通过反复操作3个步骤：顶点分裂、奇点预测和重新三角化,生成由稀疏的基网格和一系列偏移量组成的渐进网格.在奇点预测过程中,将改进Loop细分模板作为预测器.由于Loop细分相关联的顶点数目少,提高了几何模型简化和重建的速度.渐进网格易于在无线网络上渐进传输,并可在移动终端上无损重建3D图形.实验表明,算法简单、效率高,适用于移动环境下3D图形的应用.     

平面复杂花纹图案的3D建模算法研究

通过对平面复杂花纹图像或图形的矢量化处理或数据转换,得到平面复杂花纹图案清晰轮廓的数据矩阵,然后采用扫描分析法求出扫描线与轮廓线的交点,并进行配对和中点计算;运用二次Bezier曲线构建其3D模型数据矩阵,再对模型数据进行后期优化处理,最终生成平面复杂花纹图案的3D模型.该建模方法能够构想和创建平面花纹图案的虚拟模型,生成光滑细腻的模型曲面和具有图案基本结构特征的逼真模型,并能灵活控制模型生成的形态.建模算法具有复杂度低、建模速度快、实用性强等特点.     

一种针对基于图像的3D重建网格的简化算法

文章提出了一种针对“基于图像的曲面3D重建网格”的简化算法,利用原曲面光照图像的等灰度值曲线来确定初始简化三角网格,然后通过若干次细分操作改善三角网格的形状,从而形成最终的简化网格。由于所有计算都在平面图像上进行,使得复杂的三维网格简化计算变成相对容易的平面网格简化计算,并同时具有保持原曲面的显示效果的优点。实验结果显示,该算法具有高效的计算速度和良好的显示效果保持特性,并可望应用到更广泛的高度场数据的简化方法中。     

三维渗流有限元软件GWSS开发与应用

针对复杂地质条件的三维地质建模、复杂建筑物的几何建模和复杂防渗排水系统作用下渗流场精细模拟等三维渗流场有限元分析的难点问题,采用IDL开发面向水工结构和岩土工程的渗流有限元分析软件GWSS（Ground Water Simulation System）.该软件包括系统控制模块、数据管理模块、前处理模块、计算模块、后处理模块和制图输出模块等六大模块.前处理模块具有基于钻孔和钻孔剖面的三维地质建模、几何建模与有限元网格生成等功能;计算模块主要用于各种闸坝、堤防、隧道和地下洞室等渗流问题的计算分析等;后处理模块可显示各渗流要素的三维云图和任意截面的二维云图等.GWSS已经在国内四十多个工程的渗流计算中得到应用和检验.     

一种大型三维有限元网格的显示和高效消隐方法

本文提出了一种面向ＡｕｔｏＣＡＤ的大型三限元网格的显示和高效消隐方法，可实现８－２０个节点三维正确显示，并大大节省消隐的运算时间。     

A generic and scalable pipeline for GPU tetrahedral grid rendering

Recent advances in algorithms and graphics hardware have opened the possibility to render tetrahedral grids at interactive rates on commodity PCs. This paper extends on this work in that it presents a direct volume rendering method for such grids which supports both current and upcoming graphics hardware architectures, large and deformable grids, as well as different rendering options. At the core of our method is the idea to perform the sampling of tetrahedral elements along the view rays entirely in local barycentric coordinates. Then, sampling requires minimum GPU memory and texture access operations, and it maps efficiently onto a feed-forward pipeline of multiple stages performing computation and geometry construction. We propose to spawn rendered elements from one single vertex. This makes the method amenable to upcoming Direct3D 10 graphics hardware which allows to create geometry on the GPU. By only modifying the algorithm slightly it can be used to render per-pixel iso-surfaces and to perform tetrahedral cell projection. As our method neither requires any pre-processing nor an intermediate grid representation it can efficiently deal with dynamic and large 3D meshes.     

基于GB/T 24734 的三维尺寸快速标注技术

针对当前主流CAD 软件提供的三维标注功能局限的现状,结合制造企业 对复杂零件三维模型快速标注的需求,探讨了基于GB/T 24734 的三维尺寸快速标注技术; 设计并实现了三维尺寸快速标注的算法,详细阐述了其相关的技术。该算法涉及标注面自动 构造、尺寸元素计算、显示处理等一系列技术。其中,标注面构造主要涉及标注面分类、光 标点获取等操作。为了便于尺寸的显示与观察,采用了标注文字的正向显示处理技术。以 CATIA V5 系统为平台,实现了上述算法,开发了快速标注模块,通过实例测试验证了算法 的可行性。     

A finite element immersed boundary method for fluid flow around moving objects

This paper presents the extension of a recently proposed immersed boundary method to the solution of the flow around moving objects. Solving the flow around objects with complex shapes may involve extensive meshing work that has to be repeated each time a change in the geometry is needed. Mesh generation and solution interpolation between successive grids may be costly and introduce errors if the geometry changes significantly during the course of the computation. These drawbacks are avoided when the solution algorithm can tackle grids that do not fit the shape of immersed objects. This work presents an extension of our recently developed finite element Immersed Boundary (IB) method to transient applications involving the movement of immersed fluid/solid interfaces. As for the fixed solid boundary case, the method produces solutions of the flow satisfying accurately boundary conditions imposed on the surface of immersed bodies. The proposed algorithm enriches the finite element discretization of interface elements with additional degrees of freedom, the latter being eliminated at element level. The boundary of immersed objects is defined using a time dependent level-set function. Solutions are shown for various flow problems and the accuracy of the present approach is measured with respect to solutions on body-conforming meshes.     

A high efficiency parallel unstructured solver dedicated to internal combustion engine simulation

IFP-C3D, a hexahedral unstructured parallel solver dedicated to multiphysics calculation is being developed at IFP to compute the compressible combustion in internal engines. IFP-C3D uses an unstructured formalism, the finite volume method on staggered grid, time splitting, SIMPLE loop, subcycled advection, turbulent and Lagrangian spray and a liquid film model. Original algorithms and models such as the conditional temporal interpolation methodology for moving grids, the remapping algorithm for transferring quantities on different meshes during the computation enable IFP-C3D to deal with complex moving geometries with large volume deformation induced by all moving geometrical parts (intake/exhaust valve, piston). Large super-scalar machines up to 1000 processors are being widely used and IFP-C3D has been optimized for running on these Cluster machines. IFP-C3D is parallelized using the Message Passing Interface (MPI) library to distribute a calculation over a large number of processors. Moreover, IFP-C3D uses an optimized linear algebraic library to solve linear matrix systems and the METIS partitionner library to distribute the computational load equally for all meshes used during the calculation and in particular during the remap stage when new meshes are loaded. Numerical results and performance timing are presented to demonstrate the computational efficiency of the code.     

A comprehensive process of reverse engineering from 3D meshes to CAD models

In an industrial context, most manufactured objects are designed using CAD (Computer-Aided Design) software. For visualization, data exchange or manufacturing applications, the geometric model has to be discretized into a 3D mesh composed of a finite number of vertices and edges. However, the initial model may sometimes be lost or unavailable. In other cases, the 3D discrete representation may be modified, e.g. after numerical simulation, and no longer corresponds to the initial model. A retro-engineering method is then required to reconstruct a 3D continuous representation from the discrete one.In this paper, we present an automatic and comprehensive retro-engineering process dedicated mainly to 3D meshes obtained initially by mechanical object discretization. First, several improvements in automatic detection of geometric primitives from a 3D mesh are presented. Then a new formalism is introduced to define the topology of the object and compute the intersections between primitives. The proposed method is validated on 3D industrial meshes.     

基于AutoCAD的有限元前处理系统设计

以AutoCAD为几何平台,并利用其提供的二次开发技术实现了有限元前处理系统的编程。该方法解决了常规的有限元分析系统中的几何建模系统和前处理系统脱节的问题。集成了造型、单元属性设置、网格划分、显示等多种模块。研究了有限元前处理系统的若干关键技术,包括如何控制网格形态、输出求解数据接口、基于ObjectARX的CAD/CAE集成设计、复杂三维实体的四面体网格全自动生成算法。建立了一个基于AutoCAD的有限元前处理系统。     

A Parallel Finite Element Method for 3D Two-Phase Moving Contact Line Problems in Complex Domains

Moving contact line problem plays an important role in fluid-fluid interface motion on solid surfaces. The problem can be described by a phase-field model consisting of the coupled Cahn–Hilliard and Navier–Stokes equations with the generalized Navier boundary condition (GNBC). Accurate simulation of the interface and contact line motion requires very fine meshes, and the computation in 3D is even more challenging. Thus, the use of high performance computers and scalable parallel algorithms are indispensable. In this paper, we generalize the GNBC to surfaces with complex geometry and introduce a finite element method on unstructured 3D meshes with a semi-implicit time integration scheme. A highly parallel solution strategy using different solvers for different components of the discretization is presented. More precisely, we apply a restricted additive Schwarz preconditioned GMRES method to solve the systems arising from implicit discretization of the Cahn–Hilliard equation and the velocity equation, and an algebraic multigrid preconditioned CG method to solve the pressure Poisson system. Numerical experiments show that the strategy is efficient and scalable for 3D problems with complex geometry and on a supercomputer with a large number of processors.