A Self-Organizing Mesh Generation Program

1974 ◽  
Vol 96 (3) ◽  
pp. 193-199 ◽  
Author(s):  
R. E. Jones
Keyword(s):  
Mesh Generation ◽  
User Interaction ◽  
Two Dimensional ◽  
Mesh Smoothing ◽  
Smoothing Techniques ◽  
Quadrilateral Elements ◽  
Initial Mesh ◽  
Automatic Mesh ◽  
Self Organizing

A two-dimensional mesh generation program producing quadrilateral elements is presented. It uses a modular, flexible input scheme, and incorporates some existing techniques of initial mesh generation. Some new, more powerful mesh smoothing techniques are developed, and automatic mesh restructuring techniques are coupled with smoothing techniques to produce improved meshes without user interaction.

A self-organizing neural network approach for automatic mesh generation

1991 ◽  
Vol 27 (5) ◽  
pp. 4201-4204 ◽  
Author(s):  
Ahn Chang-Hoi ◽  
Lee Sang-Soo ◽  
Lee Hyuek-Jae ◽  
Lee Soo-Young
Keyword(s):  
Neural Network ◽  
Mesh Generation ◽  
Network Approach ◽  
Neural Network Approach ◽  
Automatic Mesh Generation ◽  
Automatic Mesh ◽  
Self Organizing

A Constrained Optimization Approach to Finite Element Mesh Smoothing

1991 ◽  
Author(s):  
V. N. Parthasarathy ◽  
Srinivas Kodiyalam
Keyword(s):  
Finite Element ◽  
Constrained Optimization ◽  
Finite Element Mesh ◽  
Optimization Approach ◽  
Element Mesh ◽  
Initial Mesh ◽  
Nodal Coordinates ◽  
Automatic Mesh ◽  
Mesh Generators

Abstract The quality of a finite element solution has been shown to be affected by the quality of the underlying mesh. A poor mesh may lead to unstable and lor inaccurate finite element approximations. Mesh quality is often characterized by the “smoothness” or “shape” of the elements (triangles in 2-D or tetrahedra in 3-D). Most automatic mesh generators produce an initial mesh where the aspect ratio of the elements are unacceptably high. In this paper, a new approach to produce acceptable quality meshes from an initial mesh is presented. Given an initial mesh (nodal coordinates and element connectivity), a “smooth” final mesh is obtained by solving a constrained optimization problem. The variables for the iterative optimization procedure are the nodal coordinates (excluding, the boundary nodes) of the finite element mesh, and appropriate bounds are imposed on these to prevent an unacceptable finite element mesh. Examples are given of the application of the above method for 2/3-D triangular meshes generated using a QUADTREE | OCTREE automatic mesh generators. Results indicate that the new method not only yields better quality elements when compared with the traditional Laplacian smoothing, but also guarantees a valid mesh unlike the Laplacian method.

Sign in / Sign up

Export Citation Format

Share Document