一种三维表面网格自动生成方法

提出了一种改进的区域分解法,用于三维表面三角形和四边形网格的自动生成。基于区域分解法的三维表面网格生成的主要技术包括三维表面三角形面片拓扑关系的建立,表面三角形面片的分组及特征面的确定,空间曲线上网格节点的生成,区域内外边界的合并,最佳剖分面的确定,以及网格的光滑处理等。本文对这些技术进行了详细的介绍。本文提出的表面网格生成方法具有算法可靠、生成网格效率高以及生成网格质量高等优点。最后给出三维表面网格生成实例验证了本文提出方法的可靠性。     

自适应多重网格有限元网格生成器研制

基于协调三角形剖分算法、分子表数据结构和Ｚｉｅｎｋｉｅｗｉｃｚ－Ｚｈｕ误差估计方法，本文研制出适用于自适应多重网格有限元的网格生成器。该网格生成器可对复杂的区域进行自适应加密。当荷载作用边界随时间变化及在动力荷载作用下，网格生成器可退化与再加密网格。     

自适应多重网格有限元网格生成器研制

基于协调三角形剖分算法、分子表数据结构和Ｚｉｅｎｋｉｅｗｉｃｚ－Ｚｈｕ误估计方法，本文研制出适用于自适应多重网格有限元的网格生成器，该网格生成器可对复杂的区域进行自适应加密。当荷载作用边界随时间变及在动力荷载作用下，网格生成器可退化与再加密网格。     

六面体网格再划分过程中畸变和模具干涉单元的处理方法

针对金属体积成形过程中有限元网格畸变和再划分问题,研究了工件网格畸变单元中表面四边形面片分解为三角形面片时的重叠问题,提出了将工件与模具接触区域的工件三角形面片用模具表面三角形面片代替的算法,并给出了接触区域判断、相交点计算、相交三角形环的二次剖分以及融合拼接等关键技术,算法能够很好地描述工件与模具接触区域的形状特征,...     

改进的栅格法有限元网格剖分

提出一种改进的栅格法网格剖分算法,该算法综合了栅榕法和Delaunay算法的优点,生成了四边形和三角形混合单元,保证了整体性能与局部性态最优,满足汽车覆盖件冲压成形模拟软件对有限元网格质量的需求.实践证明,本文提出的改进的栅格法网格剖分算法可行有效,生成网格的质量高,程序容易实现.该算法已经成功集成到商业化冲压成形模拟软件KMAS中.     

基于图像四叉树的改进型比例边界有限元法研究

为提高数值计算的精度, 断裂力学问题的数值模拟需要在裂纹扩展的局部区域采用较密的网格, 而远离裂纹扩展的区域可采用较疏的网格, 且对于裂纹扩展问题的数值模拟, 大多数数值方法又存在局部网格重剖分的问题. 论文提出了一种基于图像四叉树的改进型比例边界有限元法用于模拟裂纹扩展问题, 该方法可根据结构域几何外边界的图像全自动进行四叉树网格剖分, 无需任何人工干预, 网格剖分效率极高, 由于比例边界有限元法本身的优势, 四叉树网格的悬挂节点可以直接地视为新的节点, 无需任何特殊处理. 通过引入虚节点的思想, 将裂纹与四叉树单元边界交叉点作为虚节点, 虚节点的自由度作为附加自由度处理, 并采用水平集函数表征材料内部的裂纹面, 含不连续裂纹面的子域可通过节点水平集函数识别, 使得裂纹扩展时无需进行网格重剖分, 界面的几何特征通过比例边界有限元子域的附加自由度表征. 最后, 通过若干算例验证了该方法的性能, 建议的改进型比例边界有限元法在求解复合型应力强度因子和模拟材料内部裂纹扩展路径时均具有较高的精度.      

一种新的准结构网格生成方法

在有限元分析中,高质量的结构网格可以有效地提高有限元分析的精度,但结构网格的几何适应性差,针对复杂边界的二维计算模型,现有的方法很难自动生成高质量的结构网格;而非结构网格几何适应性很好,但存在计算效率低和精度差等问题。提出了一种新的准结构网格生成方法,能够实现复杂区域的网格自动生成并且具有高网格质量。该方法首先对计算区域运用Delaunay三角剖分技术生成粗背景网格;然后利用背景网格,使用优化的Voronoi图生成过渡的蜂巢网格;最后,通过中心圆方法对蜂巢网格单元进行结构网格剖分。分析NACA0012翼型数值模拟结果表明,提出的新准结构网格生成方法能够对边界复杂的模型自动生成高质量的网格,并且通过三种不同拓扑类型网格计算结果相互对比及与实验结果对比,证明准结构网格具有高计算精度。     

任意多连通域网格自动生成算法及其应用

给出了一种任意平面域内三角形网格自动生成的算法。本算法是根据下面两个事实而设计出来的：１．任意平面多连通域总可以剖分成若干个三角形单元。２．平面域内的活节点数目随着单元剖分总会趋近于零。文中还介绍了几种网格性能改善的方法。整个程序结构紧凑，需要人工输入的数据量少，生成的网格质量较高，而且算法稳定性能好。     

任意多连通域网格自动生成算法及其应用

给出了一种任意平面域内三角形网格自动生成的算法，本算法是根据下面两个事实而设计出来的：１、任意平面多连通域总可以剖分成若干个三角形单元。２、平面域内的活节点数目随着单元剖分总会趋近于零。文中还介绍了几种网格性能改善的方法，整个程序结构紧凑，需要人工输入的数据量少，生成的网格质量较高，而且处稳定性能好。     

具有大量椭圆颗粒/孔洞随机分布区域的计算机模拟及其改进三角形自动网格生成算法

针对颗粒／孔洞为椭圆形状并且呈随机分布的多相复合材料给出了一种计算机模拟方法，同时针对这样复杂的二维区域提供了一个改进的快速自动三角形网格剖分算法。最后用实例说明了算法的有效性。此算法可以推广到三维情形、裂纹材料等。     

A method for generating irregular computational grids in multiply connected planar domains

A method for generating irregular triangular computational grids in two-dimensional multiply connected domains is described. A set of points around each body is defined using a simple grid generation technique appropriate to the geometry of each body. The Voronoi regions associated with the resulting global point distribution are constructed from which the Delaunay triangulation of the set of points is thus obtained. The definition of Voronoi regions ensures that the triangulation produces triangles of reasonable aspect ratios given a grid point distribution. The approach readily accommodates local clustering of grid points to facilitate variable resolution of the domain. The technique is generally applicable and has been used with success in computing triangular grids in multiply connected planar domains. The suitability of such grids for flow calculations is demonstrated using a finite element method for solution of the inviscid transonic flow over two- dimensional high-lift aerofoil configurations.     

基于Voronoi cells的二维不规则自适应网格的生成及其应用

基于Voronoi cells的数据结构和算法，给出了一种二维不规则自适应网格的生成方法，用VisualC＋＋语言在微机上开发了Windows环境下网格自动生成的可视化软件。既可以得到Voronoi cells网格，也可得到相应的Delaunay triangles网格，网格生成的实例表明，本文方法所得到的网格非常适合于多尺度系统的流动问题的计算，具有较好的应用前景。     

任意平面区域的变尺寸有限元网格划分

利用任意平面域边界表述中的拓年要素定义网格的控制信息,通过引入节点间距函数来控制区域内网格尺寸变化,并将结合前沿生成法和Ｄｅｌａｕｎａｙ三角化方法的优点,优先处理前沿的最长边,尽可能在局部生成边长逐渐减小的Ｄｅｌａｕｎａｙ三角形,最终实验区域内网格的疏密过渡。     

A simple quality triangulation algorithm for complex geometries

This paper presents a simple algorithm for quality triangulation in domains with complex geometries. Based on the fact that the equilateral triangles (regular meshes) are ideal for numerical computations in computational fluids dynamics (CFD) analysis, the proposed algorithm starts with an initial equilateral triangle mesh covering the whole domain. Nodes close to the boundary edges satisfy the so‐called non‐encroaching criterion, the distance from any inserted node to any boundary vertices and the midpoints of any boundary edge is greater than a given characteristic length. Both nearly uniform and non‐uniform triangle meshes can be generated using a mesh size reduction technique. Local refinement is achieved by using transition layers. More regular meshes can be generated in the interior of the domain and all angles of the triangle mesh produced by this algorithm are proven to be bounded in a reasonable range (19.5–141°). Copyright © 2010 John Wiley & Sons, Ltd.     

任意平面区域三角形网格的全自动生成算法

本文基于波前法提出了一种对任意平面区域生成三角形网格自动生成算法。算法具有区域适应性强,边界网格质量高,自动化程度高的优点。算法还包括了网格的拓扑优化,光滑及加密处理。此外,初边值条件的自动给定大大减少了数值计算中数据输入和避免了边界搜索计算。大量算例显示了算法的可靠性和适用性。     

Free-floating closed-chain planar robots: Kinematics and path planning

The study of free-floating manipulators is important for the success of robotics program in space and in the design of innovative robot systems which can operate over a large workspace. In order to study the fundamental theoretical and experimental issues encountered in space robotics, a closed-chain planar manipulator was built at Ohio University (OU) which floats on a flat table using air bearings. Due to the absence of external forces in the plane of the table and couples normal to this plane, the linear momentum in the plane and the angular momentum normal to this plane are conserved. It is well known that the linear momentum equations are holonomic while the angular momentum equation is nonholonomic. Due to this nonholonomic behavior, the path-planning schemes commonly used for fixed-base manipulators do not directly apply to free-floating manipulators. In this paper, we present an algorithm for motion planning of planar free-floating manipulators based on the inverse position kinematics of the mechanism. It is demonstrated that the inverse position kinematics algorithms, commonly used for fixed-base manipulators, can be successfully applied to free-floating manipulators using an iterative search procedure to satisfy the nonholonomic angular momentum constraints. This procedure results in paths identical to those predicted by inverse rate kinematics. The inverse position kinematics algorithm is then used to avoid singularities during motion to result in successful paths. The results of the simulation of this algorithm using parameter estimates of the OU free-floating robot are presented.     

脆性材料破坏模拟的网格生成算法

脆性材料的破坏过程具有随机性,当前的网格生成算法没有充分考虑脆性材料破坏时裂纹扩展和碎块生成的随机性。在Persson网格生成算法与Delaunay随机网格剖分理论基础上,提出了一种可根据模拟需要动态控制网格品质的网格生成算法。通过对随机分布点的Delauna三角化,生成初始网格,然后将网格体系比拟为桁架结构,网格节点即为桁架节点。桁架节点在虚拟力作用下可动态调整位置,并最终达到整个体系受力平衡。对Persson 算法中的尺寸分布函数和收敛条件进行了修正,从而提高了收敛速度,并适用于任意形状对象的网格剖分。 基于VC++平台开发了算法程序。通过实例对算法进行了验证,表明算法能够满足脆性材料破碎模拟的需要。     

三维约束Delaunay三角化的边界恢复和薄元消除方法

提出一种有效的三维约束Delaunay三角剖分的边界恢复算法，该算法综合了P．L．George算法和N．P．Weatherill算法的优点，通过将约束边和约束面加以恢复，保持了实体边界的完整性，解决了经典Delaunay算法不能剖分凹域的问题，从而实现了复杂三维实体的网格剖分。提出了一种简易而有效的消除薄元方法——薄元分解法，彻底解决了三维Delaunay三角剖分过程中所产生的薄元问题。实践证明，本文提出的边界恢复算法和薄元消除算法健壮有效，生成网格的质量高，并且易于实现。     

Co-located equal-order control-volume finite element method for two-dimensional axisymmetric incompressible fluid flow

The formulation of a control-volume-based finite element method (CVFEM) for axisymmetric, two-dimensional, incompressible fluid flow and heat transfer in irregular-shaped domains is presented. The calculation domain is discretized into torus-shaped elements and control volumes. In a longitudinal cross-sectional plane, these elements are three-node triangles, and the control volumes are polygons obtained by joining the centroids of the three-node triangles to the mid-points of the sides. Two different interpolation schemes are proposed for the scalar-dependent variables in the advection terms: a flow-oriented upwind function, and a mass-weighted upwind function that guarantees that the discretized advection terms contribute positively to the coefficients in the discretized equations. In the discretization of diffusion transport terms, the dependent variables are interpolated linearly. An iterative sequential variable adjustment algorithm is used to solve the discretized equations for the velocity components, pressure and other scalar-dependent variables of interest. The capabilities of the proposed CVFEM are demonstrated by its application to four different example problems. The numerical solutions are compared with the results of independent numerical and experimental investigations. These comparisons are quite encouraging.     

Investigation of the hysteresis phenomena in steady shock reflection using kinetic and continuum methods

The problem of transition of planar shock waves over straight wedges in steady flows from regular to Mach reflection and back was numerically studied by the DSMC method for solving the Boltzmann equation and finite difference method with FCT algorithm for solving the Euler equations. It is shown that the transition from regular to Mach reflection takes place in accordance with detachment criterion while the opposite transition occurs at smaller angles. The hysteresis effect was observed at increasing and decreasing shock wave angle. Received September 1, 1995 / Accepted November 20, 1995