首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
This paper deals with some aspects of unstructured mesh generation in three dimensions by the advancing front technique. In particular, the parameters used in the algorithm are characterized, and strategies that may be used to improve robustness are suggested. We also describe a method whereby structured tetrahedral meshes with exceptionally stretched elements adjacent to boundary surfaces may be produced. The suggested method can be combined with the advancing front concept in a natural way.  相似文献   

2.
    
In recent years, demand for three‐dimensional simulations has continued to grow in the field of computer‐aided engineering. Especially, in the analysis of forming processes a fully automatic and robust mesh generator is necessary for handling complex geometries used in industry. For three‐dimensional analyses, tetrahedral elements are commonly used due to the advantage in dealing with such geometries. In this study, the advancing front technique has been implemented and modified using an optimization scheme. In this optimization scheme, the distortion metric determines ‘when and where’ to smooth, and serves as an objective function. As a result, the performance of the advancing front technique is improved in terms of mesh quality generated. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   

3.
    
In this work, a new method for inserting a surface as an internal boundary into an existing unstructured tetrahedral mesh is developed. The surface is discretized by initially placing vertices on its bounding curves, defining a length scale at every location on each boundary curve based on the local underlying mesh, and equidistributing length scale along these curves between vertices. The surface is then sampled based on this boundary discretization, resulting in a surface mesh spaced in a way that is consistent with the initial mesh. The new points are then inserted into the mesh, and local refinement is performed, resulting in a final mesh containing a representation of the surface while preserving mesh quality. The advantage of this algorithm over generating a new mesh from scratch is in allowing for the majority of existing simulation data to be preserved and not have to be interpolated onto the new mesh. This algorithm is demonstrated in two and three dimensions on problems with and without intersections with existing internal boundaries. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

4.
    
A method for the rapid construction of meshes over intersecting triangulated shapes is described. The method is based on an algorithm that automatically generates a surface mesh from intersecting triangulated surfaces by means of Boolean intersection/union operations. After the intersection of individual components is obtained, the exposed surface parts are extracted. The algorithm is intended for rapid interactive construction of non‐trivial surfaces in engineering design, manufacturing, visualization and molecular modelling applications. Techniques to make the method fast and general are described. The proposed algorithm is demonstrated on a number of examples, including intersections of multiple spheres, planes and general engineering shapes, as well as generation of surface and volume meshes around clusters of intersecting components followed by the computation of flow field parameters. Copyright © 1999 John Wiley & Sons, Ltd.  相似文献   

5.
王小庆  金先龙 《振动与冲击》2014,33(21):102-107
针对大规模网格串行生成的时间和内存瓶颈问题,阐述了一种非结构化四面体网格并行生成方法,首先对几何体进行初始网格划分,并通过相对体积比及最优分区控制初始网格数量;然后采用图论图划分方法对初始网格进行区域分解;最后采用分裂法进行并行网格生成。提出的基于共享单元的边界判定方法,有效地解决了分区边界节点的匹配问题。通过算例证明了该并行网格生成方法具有良好的并行效率,同时可以产生高质量的四面体网格。  相似文献   

6.
    
The generation of all‐hexahedral finite element meshes has been an area of ongoing research for the past two decades and remains an open problem. Unconstrained plastering is a new method for generating all‐hexahedral finite element meshes on arbitrary volumetric geometries. Starting from an unmeshed volume boundary, unconstrained plastering generates the interior mesh topology without the constraints of a pre‐defined boundary mesh. Using advancing fronts, unconstrained plastering forms partially defined hexahedral dual sheets by decomposing the geometry into simple shapes, each of which can be meshed with simple meshing primitives. By breaking from the tradition of previous advancing‐front algorithms, which start from pre‐meshed boundary surfaces, unconstrained plastering demonstrates that for the tested geometries, high quality, boundary aligned, orientation insensitive, all‐hexahedral meshes can be generated automatically without pre‐meshing the boundary. Examples are given for meshes from both solid mechanics and geotechnical applications. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

7.
    
We present a method to adapt a tetrahedron mesh together with a surface mesh with respect to a size criterion. The originality of our work lies in the fact that both surface and tetrahedron mesh adaptation are carried out simultaneously and that no CAD is required to adapt the surface mesh. The adaptation procedure consists of splitting or removing interior and surface edges which violate a given size criterion. The enrichment process is based on a bisection technique. In order to guarantee mesh conformity during the refinement process, all possible remeshing configurations of tetrahedra have been examined. Once the tetrahedron mesh has been adapted, surface nodes are projected on a geometrical model. The building of a surface model from discrete data has already been presented in this journal. The method is based on a mesh‐free technique called Hermite Diffuse Interpolation. Surface and volume mesh optimization procedures are carried out during the adaptation and at the end of the process to enhance the mesh. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   

8.
    
A new algorithm for constructing full quadrilateral anisotropic meshes on 3D surfaces is proposed in this paper. The proposed method is based on the advancing front and the systemic merging techniques. Full quadrilateral meshes are constructed by systemically converting triangular elements in the background meshes into quadrilateral elements.By using the metric specifications to describe the element characteristics, the proposed algorithm is applicable to convert both isotropic and anisotropic triangular meshes into full quadrilateral meshes. Special techniques for generating anisotropic quadrilaterals such as new selection criteria of base segment for merging, new approaches for the modifications of the background mesh and construction of quadrilateral elements, are investigated and proposed in this study. Since the final quadrilateral mesh is constructed from a background triangular mesh and the merging procedure is carried out in the parametric space, the mesh generator is robust and no expensive geometrical computation that is commonly associated with direct quadrilateral mesh generation schemes is needed. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   

9.
    
In this paper, we propose efficient and robust unstructured mesh generation methods based on computed tomography (CT) and magnetic resonance imaging (MRI) data, in order to obtain a patient‐specific geometry for high‐fidelity numerical simulations. Surface extraction from medical images is carried out mainly using open source libraries, including the Insight Segmentation and Registration Toolkit and the Visualization Toolkit, into the form of facet surface representation. To create high‐quality surface meshes, we propose two approaches. One is a direct advancing front method, and the other is a modified decimation method. The former emphasizes the controllability of local mesh density, and the latter enables semi‐automated mesh generation from low‐quality discrete surfaces. An advancing‐front‐based volume meshing method is employed. Our approaches are demonstrated with high‐fidelity tetrahedral meshes around medical geometries extracted from CT/MRI data. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

10.
    
Local transformation, or topological reconnection, is one of the effective procedures for mesh improvement method, especially for three‐dimensional tetrahedral mesh. The most frequently used local transformations for tetrahedral mesh are so‐called elementary flips, such as 2‐3 flip, 3‐2 flip, 2‐2 flip, and 4‐4 flip. Owing to the reason that these basic transformations simply make a selection from several possible configurations within a relatively small region, the improvement of mesh quality is confined. In order to further improve the quality of mesh, the authors recently suggested a new local transformation operation, small polyhedron reconnection (SPR) operation, which seeks for the optimal tetrahedralization of a polyhedron with a certain number of nodes and faces (typically composed of 20–40 tetrahedral elements). This paper is an implementation of the suggested method. The whole process to improve the mesh quality by SPR operation is presented; in addition, some strategies, similar to those used in advancing front technique, are introduced to speed up the operation. The numerical experiment shows that SPR operation is quite effective in mesh improvement and more suitable than elementary flips when combined with smoothing approach. The operation can be applied to practical problems, gaining high mesh quality with acceptable cost for computational time. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

11.
    
This paper presents a new computational method for anisotropic tetrahedral meshing. The method can control element anisotropy based on a specified 3×3 tensor field defined over a volumetric domain. Our method creates a tetrahedral mesh in two steps: (1) placing nodes at the centres of tightly packed ellipsoidal cells, called bubbles, in the domain, and (2) connecting the nodes by a modified advancing front followed by local transformation. The method creates a high‐quality anisotropic mesh that conforms well to a specified tensor field. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   

12.
13.
    
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.  相似文献   

14.
  总被引:1,自引:0,他引:1  
The centroidal Voronoi tessellation based Delaunay triangulation (CVDT) provides an optimal distribution of generating points with respect to a given density function and accordingly generates a high‐quality mesh. In this paper, we discuss algorithms for the construction of the constrained CVDT from an initial Delaunay tetrahedral mesh of a three‐dimensional domain. By establishing an appropriate relationship between the density function and the specified sizing field and applying the Lloyd's iteration, the constrained CVDT mesh is obtained as a natural global optimization of the initial mesh. Simple local operations such as edges/faces flippings are also used to further improve the CVDT mesh. Several complex meshing examples and their element quality statistics are presented to demonstrate the effectiveness and efficiency of the proposed mesh generation and optimization method. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   

15.
    
Structured mesh quality optimization methods are extended to optimization of unstructured triangular, quadrilateral, and mixed finite element meshes. New interpretations of well‐known nodally based objective functions are made possible using matrices and matrix norms. The matrix perspective also suggests several new objective functions. Particularly significant is the interpretation of the Oddy metric and the smoothness objective functions in terms of the condition number of the metric tensor and Jacobian matrix, respectively. Objective functions are grouped according to dimensionality to form weighted combinations. A simple unconstrained local optimum is computed using a modified Newton iteration. The optimization approach was implemented in the CUBIT mesh generation code and tested on several problems. Results were compared against several standard element‐based quality measures to demonstrate that good mesh quality can be achieved with nodally based objective functions. Published in 2000 by John Wiley & Sons, Ltd.  相似文献   

16.
    
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.  相似文献   

17.
N P Weatherill 《Sadhana》1991,16(1):1-45
In recent years there has been much research activity in the field of compressible flow simulation for aerodynamic applications. In the 1970’s and 1980’s the advances in the numerical solution of the Full Potential and Euler equations made, in principle, the inviscid flow simulation around complex aerodynamic shapes possible. At this stage much attention was focused on methods capable of generating meshes on which such calculations could be performed. In this paper an overview is presented of some techniques which have been developed to generate meshes for aerospace applications. Structured mesh generation techniques are discussed and their application to complicated shapes utilising the multiblock approach is highlighted. Unstructured mesh generation methods are also discussed with particular emphasis given to the Delaunay triangulation method. Finally, the advantages and disadvantages of the structured and unstructured approaches are discussed and new work is presented which attempts to utilise both these approaches in an efficient and flexible manner. An erratum to this article is available at .  相似文献   

18.
    
Advances in tetrahedral mesh generation for general, three‐dimensional domains with and without cracks are described and validated through extensive studies using a wide range of global geometries and local crack shapes. Automated methods are described for (a) implementing geometrical measures in the vicinity of the crack to identify irregularities and to improve mesh quality and (b) robust node selection on crack surfaces to ensure optimal meshing both locally and globally. The resulting numerical algorithms identify both node coincidence and also local crack surface penetration due to discretization of curved crack surfaces, providing a proven approach for removing inconsistencies. Numerical examples using the resulting 3D mesh generation program to mesh complex 3D domains containing a range of crack shapes and sizes are presented. Quantitative measures of mesh quality clearly show that the element shape and size distributions are excellent, including in regions surrounding crack fronts. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

19.
    
In this paper, a new metric advancing front surface mesh generation scheme is suggested. This new surface mesh generator is based on a new geometrical model employing the interpolating subdivision surface concept. The target surfaces to be meshed are represented implicitly by interpolating subdivision surfaces which allow the presence of various sharp and discontinuous features in the underlying geometrical model. While the main generation steps of the new generator are based on a robust metric surface triangulation kernel developed previously, a number of specially designed algorithms are developed in order to combine the existing metric advancing front algorithm with the new geometrical model. As a result, the application areas of the new mesh generator are largely extended and can be used to handle problems involving extensive changes in domain geometry. Numerical experience indicates that, by using the proposed mesh generation scheme, high quality surface meshes with rapid varying element size and anisotropic characteristics can be generated in a short time by using a low‐end PC. Finally, by using the pseudo‐curvature element‐size controlling metric to impose the curvature element‐size requirement in an implicit manner, the new mesh generation procedure can also generate finite element meshes with high fidelity to approximate the target surfaces accurately. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   

20.
    
Q‐Morph is a new algorithm for generating all‐quadrilateral meshes on bounded three‐dimensional surfaces. After first triangulating the surface, the triangles are systematically transformed to create an all‐quadrilateral mesh. An advancing front algorithm determines the sequence of triangle transformations. Quadrilaterals are formed by using existing edges in the triangulation, by inserting additional nodes, or by performing local transformations to the triangles. A method typically used for recovering the boundary of a Delaunay mesh is used on interior triangles to recover quadrilateral edges. Any number of triangles may be merged to form a single quadrilateral. Topological clean‐up and smoothing are used to improve final element quality. Q‐Morph generates well‐aligned rows of quadrilaterals parallel to the boundary of the domain while maintaining a limited number of irregular internal nodes. The proposed method also offers the advantage of avoiding expensive intersection calculations commonly associated with advancing front procedures. A series of examples of Q‐Morph meshes are also presented to demonstrate the versatility of the proposed method. Copyright © 1999 John Wiley & Sons, Ltd.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号