共查询到7条相似文献，搜索用时 0 毫秒
1.
2.
A. Rassineux 《International journal for numerical methods in engineering》1998,41(4):651-674
An algorithm for tetrahedron mesh generation and optimization with respect to a shape and a size criterion is presented. A well distributed set of nodes is first generated by an octree method, and the set is then triangulated. The advancing front technique is used to mesh the whole volume. Emphasis has been placed on management of the front. The method involves priority construction of enhanced quality tetrahedra. Each face is assigned to a front corresponding to the quality of the best tetrahedron which can be constructed. Elements are destroyed in the case of non-convergence. Optimization procedures make local use of the algorithm used to mesh the complete model. Industrial examples of relatively complex volumes are given, demonstrating that a high quality and optimized mesh can be obtained by the proposed method. © 1998 John Wiley & Sons, Ltd. 相似文献
3.
Peter Mller Peter Hansbo 《International journal for numerical methods in engineering》1995,38(21):3551-3569
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. 相似文献
4.
Woo‐Young Choi Dae‐Young Kwak Il‐Heon Son Yong‐Taek Im 《International journal for numerical methods in engineering》2003,58(12):1857-1872
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. 相似文献
5.
Y. K. Lee C. K. Lee 《International journal for numerical methods in engineering》2002,53(12):2673-2700
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. 相似文献
6.
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. 相似文献