共查询到20条相似文献，搜索用时 0 毫秒
1.
Stefano Pippa Gianni Caligiana 《International journal for numerical methods in engineering》2005,62(4):495-515
In this paper a new method, called GradH‐Correction, for the generation of multi‐patch parametric surface meshes with controlled sizing gradation is presented. Such gradation is obtained performing a correction on the size values located on the vertices of the background mesh used to define the control space that governs the meshing process. In the presence of a multi‐patch surface, like shells of BREP solids, the proposed algorithm manages the whole composite surface simultaneously and as a unique entity. Sizing information can spread from a patch to its adjacent ones and the resulting size gradation is independent from the surface partitioning. Theoretical considerations lead to the assertion that, given a parameter λ, after performing a GradH‐Correction of level λ over the control space, the unit mesh constructed using the corrected control space is a mesh of gradation λ in the real space (target space). This means that the length ratio of any two adjacent edges of the mesh is bounded between 1/λ and λ. Numerical results show that meshes generated from corrected control spaces are of high quality and good gradation also when the background mesh has poor quality. However, due to mesh generator imprecision and theoretical limitations, guaranteed gradation is achieved only for the sizing specifications and not for the generated mesh. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
2.
Petr Krysl Michael Ortiz 《International journal for numerical methods in engineering》2001,50(7):1737-1758
Many computational science tools employ finite element meshes as discretizations of the geometrical domains, and automatic mesh generation has become an indispensable part of the discretization process. Boundary representations (BRep) of solids are the means of describing the geometrical model to the mesher, thus enabling the generator to proceed without user intervention. Significant effort has been devoted in the past to BRep construction in the frame‐work of solid modelling systems. In this paper we consider the task of converting a tesselation (triangulation) of the surface of a solid into a BRep, and propose a robust and efficient set of algorithms for this purpose. Applications include, among others, remeshing of finite element discretizations during simulations involving not only geometric distortion but also changes in topology (coalescence and fragmentation of solids, flow, and so on). Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
3.
K. KONDO 《International journal for numerical methods in engineering》1996,39(20):3519-3534
This paper describes an efficient algorithm for fully automated three-dimensional finite element meshing which is applicable to non-convex geometry and non-manifold topology. This algorithm starts with sparsely placed nodes on the boundaries of a geometric model and a corresponding 3-D Delaunay triangulation. Nodes are then inserted incrementally by checking the tetrahedral mesh geometry and topological compatibility between Delaunay triangulation and the geometric model. Topological compatibility is checked in a robust manner by a method which relies more on a mesh's topology than its geometry. The node placement strategy is tightly coupled to an incremental Delaunay triangulation algorithm, and results in a low growth rate of computational time. 相似文献
4.
Luiz Cristovo G. Coelho Marcelo Gattass Luiz Henrique de Figueiredo 《International journal for numerical methods in engineering》2000,47(4):777-800
We present an algorithm for intersecting finite element meshes defined on parametric surface patches. The intersection curves are modelled precisely and both meshes are adjusted to the newly formed borders, without unwanted reparametrizations. The algorithm is part of an interactive shell modelling program that has been used in the design of large offshore oil structures. To achieve good interactive response, we represent meshes with a topological data structure that stores its entities in spatial indexing trees instead of linear lists. These trees speed up the intersection computations required to determine points of the trimming curves; moreover, when combined with the topological information, they allow remeshing using only local queries. Copyright © 2000 John Wiley & Sons, Ltd. 相似文献
5.
Zhenqun Guan Julin Shan Yao Zheng Yuanxian Gu 《International journal for numerical methods in engineering》2008,74(4):642-667
An extended advancing front technique (AFT) with shift operations and Riemann metric named as shifting‐AFT is presented for finite element mesh generation on 3D surfaces, especially 3D closed surfaces. Riemann metric is used to govern the size and shape of the triangles in the parametric space. The shift operators are employed to insert a floating space between real space and parametric space during the 2D parametric space mesh generation. In the previous work of closed surface mesh generation, the virtual boundaries are adopted when mapping the closed surfaces into 2D open parametric domains. However, it may cause the mesh quality‐worsening problem. In order to overcome this problem, the AFT kernel is combined with the shift operator in this paper. The shifting‐AFT can generate high‐quality meshes and guarantee convergence in both open and closed surfaces. For the shifting‐AFT, it is not necessary to introduce virtual boundaries while meshing a closed surface; hence, the boundary discretization procedure is largely simplified, and moreover, better‐shaped triangles will be generated because there are no additional interior constraints yielded by virtual boundaries. Comparing with direct methods, the shifting‐AFT avoids costly and unstable 3D geometrical computations in the real space. Some examples presented in this paper have demonstrated the advantages of shift‐AFT in 3D surface mesh generation, especially for the closed surfaces. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
6.
David A. Field 《International journal for numerical methods in engineering》2001,50(8):1861-1876
Advances in commercial computer‐aided design software have made finite element analysis with three‐dimensional solid finite elements routinely available. Since these analyses usually confine themselves to those geometrical objects for which particular CAD systems can produce finite element meshes, expanding the capability of analyses becomes an issue of expanding the capability of generating meshes. This paper presents a method for stitching together two three‐dimensional meshes with diverse elements that can include tetrahedral, pentahedral and hexahedral solid finite elements. The stitching produces a mesh that coincides with the edges which already exist on the portion of boundaries that will be joined. Moreover, the transitional mesh does not introduce new edges on these boundaries. Since the boundaries of the regions to be stitched together can have a mixture of triangles and quadrilaterals, tetrahedral and pyramidal elements provide the transitional elements required to honor these constraints. On these boundaries a pyramidal element shares its base face with the quadrilateral faces of hexahedra and pentahedra. Tetrahedral elements share a face with the triangles on the boundary. Tetrahedra populate the remaining interior of the transitional region. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
7.
The matrix condensation technique in conjunction with the substructuring principle has been previously used to model complex
commercial automotive mufflers. Though complete 3-D finite element modelling is partially eliminated, it still requires the
nodal-coordinate data and connectivity data of the elements forming the segment of each substructure. It also demands the
connectivity of the degrees of freedom left after matrix condensation. Thus, the data preparation phase is tedious and cannot
be claimed to be simple. Moreover, the existing FEM code requires the user to have a knowledge of acoustic theory and finite
element modelling. This paper describes a way to completely eliminate the data preparation phase. Given the geometric dimensions
of the muffler as input, the muffler performance is obtained as the output. The results obtained are compared with analytical
and experimental results for simple as well as extended-tube expansion chambers, with or without an offset. 相似文献
8.
为了解决非均匀有理B样条(NURBS)拟合二次曲面精度低、过程复杂的问题,提出了一种u、v参数化方向选择及求解出最优控制点个数选取范围的高效拟合二次曲面的方法。首先,根据二次曲面的形状特征确定u、v的参数化方向;然后,利用差值绝对值和均方根误差对不同控制点个数拟合出的各个重构曲面进行误差定量分析,根据定量分析的结果曲线求解拟合二次曲面的最优控制点个数的最小取值;最后,结合程序运行时间的关系曲线求解拟合二次曲面的最优控制点个数的最大取值。实例表明:较为常见的二次曲面的NURBS最优控制点个数的合理选取范围为201～541。该分析结果为NURBS标准分析表面的拟合过程中遇到的问题提供了理论支持和技术参考。 相似文献
9.
C. K. Lee Q. X. Xu 《International journal for numerical methods in engineering》2005,62(11):1519-1558
A new algorithm to generate three‐dimensional (3D) mesh for thin‐walled structures is proposed. In the proposed algorithm, the mesh generation procedure is divided into two distinct phases. In the first phase, a surface mesh generator is employed to generate a surface mesh for the mid‐surface of the thin‐walled structure. The surface mesh generator used will control the element size properties of the final mesh along the surface direction. In the second phase, specially designed algorithms are used to convert the surface mesh to a 3D solid mesh by extrusion in the surface normal direction of the surface. The extrusion procedure will control the refinement levels of the final mesh along the surface normal direction. If the input surface mesh is a pure quadrilateral mesh and refinement level in the surface normal direction is uniform along the whole surface, all hex‐meshes will be produced. Otherwise, the final 3D meshes generated will eventually consist of four types of solid elements, namely, tetrahedron, prism, pyramid and hexahedron. The presented algorithm is highly flexible in the sense that, in the first phase, any existing surface mesh generator can be employed while in the second phase, the extrusion procedure can accept either a triangular or a quadrilateral or even a mixed mesh as input and there is virtually no constraint on the grading of the input mesh. In addition, the extrusion procedure development is able to handle structural joints formed by the intersections of different surfaces. Numerical experiments indicate that the present algorithm is applicable to most practical situations and well‐shaped elements are generated. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
10.
11.
Rao V. Garimella 《International journal for numerical methods in engineering》2002,55(4):451-478
The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
12.
Il‐Heon Son Yong‐Taek Im 《International journal for numerical methods in engineering》2006,67(5):672-696
The localized remeshing technique for three‐dimensional metal forming simulations is proposed based on a mixed finite element formulation with linear tetrahedral elements in the present study. The numerical algorithm to generate linear tetrahedral elements is developed for finite element analyses using the advancing front technique with local optimization method which keeps the advancing fronts smooth. The surface mesh generation using mesh manipulations of the boundary elements of the old mesh system was made to improve mesh quality of the boundary surface elements, resulting in reduction of volume change in forming simulations. The mesh quality generated was compared with that obtained from the commercial CAD package for the complex geometry like lumbar. The simulation results of backward extrusion and bevel gear and spider forgings indicate that the currently developed simulation technique with the localized remeshing can be used effectively to simulate the three‐dimensional forming processes with a reduced computation time. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
13.
14.
15.
Pascal J. Frey 《International journal for numerical methods in engineering》2004,60(6):1049-1074
Fast and accurate scanning devices are nowadays widely used in many engineering and biomedical fields. The resulting discrete data is usually directly converted into polygonal surface meshes, using ‘brute‐force’ algorithms, often resulting in meshes that may contain several millions of polygons. Simplification is therefore required in order to make storage, computation and display possible if not efficient. In this paper, we present a general scheme for mesh simplification and optimization that allows to control the geometric approximation as well as the element shape and size quality (required for numerical simulations). Several examples ranging from academic to complex biomedical geometries (organs) are presented to illustrate the efficiency and the utility of the proposed approach. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
16.
目的 研究高质量、高效率的网格生成技术以实现大型复杂结构的焊接工艺仿真优化。方法 提出一种组合式的自适应四面体网格划分算法,即在高效生成各个零部件四面体网格的基础上,根据焊缝中心面的几何信息自动对焊缝附近网格进行细分,再缝合成高质量的大型复杂焊接结构的整体四面体网格,并集成到自主可控的商用网格划分软件Vision Mesh中。提出了摄动几何边界的方法,解决了大型复杂结构STL几何体在存在几何错误时网格难以生成的问题。提出了基于BVH树结构表达的背景网格表达方法,解决了多条焊缝同时高效、自动细分的难题,并通过“四面体分割–四面体合并–四面体翻转–点平滑优化”方法,实现了四面体网格的高质量优化。结果 算法网格效率可以达到200万个/h,生成的四面体99%以上均接近正四面体。可以由多个零部件一步组合生成大型结构的整体网格,并可对焊缝区域进行自动细分,大幅度简化了划分流程。将生成的网格导入国产焊接仿真软件InteWeld中进行测试,验证算法可用于大型复杂焊接结构整体应力变形的计算中。结论 实现了大型复杂焊接结构的高质量自适应四面体网格划分,使用简便操作得到了高质量网格,为焊接结构件工艺仿真优化... 相似文献
17.
A. Gargallo‐Peiró X. Roca J. Peraire J. Sarrate 《International journal for numerical methods in engineering》2016,106(13):1100-1130
A framework to validate and generate curved nodal high‐order meshes on Computer‐Aided Design (CAD) surfaces is presented. The proposed framework is of major interest to generate meshes suitable for thin‐shell and 3D finite element analysis with unstructured high‐order methods. First, we define a distortion (quality) measure for high‐order meshes on parameterized surfaces that we prove to be independent of the surface parameterization. Second, we derive a smoothing and untangling procedure based on the minimization of a regularization of the proposed distortion measure. The minimization is performed in terms of the parametric coordinates of the nodes to enforce that the nodes slide on the surfaces. Moreover, the proposed algorithm repairs invalid curved meshes (untangling), deals with arbitrary polynomial degrees (high‐order), and handles with low‐quality CAD parameterizations (independence of parameterization). Third, we use the optimization procedure to generate curved nodal high‐order surface meshes by means of an a posteriori approach. Given a linear mesh, we increase the polynomial degree of the elements, curve them to match the geometry, and optimize the location of the nodes to ensure mesh validity. Finally, we present several examples to demonstrate the features of the optimization procedure, and to illustrate the surface mesh generation process. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
18.
Liyong Tong Xiannian Sun 《International journal for numerical methods in engineering》2003,58(5):793-820
Adhesive bonding has been widely used to join or repair metallic and composite structural components to achieve or restore their designated structural stiffness and strengths. However, current analysis methods and empirical databases for composite bonded patch repairs or joints are limited to flat structures, and there exists a very limited knowledge on the effect of curvature on the performance and durability of composite bonded joints and repairs. Recently, a novel finite element formulation was presented for developing adhesive elements for conducting 2.5‐D simplified stress analysis of bonded repairs to curved structures. This paper presents the work on optimal shape design of a bonded curved composite patch using the newly developed adhesive element. The Sequential Linear Programming (SLP) method is employed as the optimization algorithm in conjunction with a fully implemented mesh generation algorithm into which new features have been incorporated. The objective of shape optimization is to minimize the maximum stress in the entire adhesive layer to ensure that the bonded patch effectively works together with the parent structure in service. Several different objective functions, related to possible failure mechanisms of the adhesive layer, are proposed to optimize the shape of a bonded patch. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
19.
R. Aubry G. Houzeaux M. Vázquez 《International journal for numerical methods in engineering》2011,85(12):1475-1498
A method is presented to remesh three‐dimensional discrete data surfaces. The originality of the method resides in mimicking heavily the classical adva10ncing front method for quality while always relying on a valid mesh for robustness. Therefore, local operations are applied in a first step to obtain a mesh of appropriate length scale compared to the specified size, and an original procedure has been developed for refinement that automatically degenerates to a surface mesh optimization if the size map has been respected. A valid mesh is then always available during the remeshing procedure. A new background grid is proposed that relies on a Cartesian mesh for the size distribution. Interpolation is performed very quickly and the size distribution is smoothed out to provide a slowly varying mesh size distribution. Various numerical results are presented to illustrate the efficiency but mainly the quality and robustness of the method. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
20.
Qiang Du Desheng Wang 《International journal for numerical methods in engineering》2004,61(9):1471-1500
A new constrained boundary recovery method for three dimensional Delaunay triangulations is presented. It successfully resolves the difficulties related to the minimal addition of Steiner points and their good placement. Applications to full mesh generation are discussed and numerical examples are provided to illustrate the effectiveness of guaranteed recovery procedure. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献