Automatic mesh generator based on self-organizing finite-element tessellation for electromagnetic field problems

1995 ◽  
Vol 31 (3) ◽  
pp. 1757-1760 ◽  
Author(s):  
Bong-Sik Jeong ◽  
Soo-Young Lee ◽  
Chang-Hoi Ahn
Keyword(s):  
Finite Element ◽  
Electromagnetic Field ◽  
Mesh Generator ◽  
Automatic Mesh ◽  
Self Organizing

Particle trajectory calculations using finite element electromagnetic field maps

1988 ◽  
Vol 24 (6) ◽  
pp. 3126-3128 ◽  
Author(s):  
M.D.N. Lunney ◽  
R.B. Moore ◽  
J.P. Webb ◽  
B. Forghani
Keyword(s):  
Finite Element ◽  
Electromagnetic Field ◽  
Particle Trajectory ◽  
Trajectory Calculations

Finite Element Mesh Generator Applying Constraints’ Propagation and Isoparametric Mapping

1991 ◽  
Author(s):  
J. Rodriguez ◽  
M. Him
Keyword(s):  
Finite Element ◽  
Mesh Generation ◽  
Element Model ◽  
Finite Element Mesh ◽  
Fe Model ◽  
Element Analysis ◽  
Element Mesh ◽  
Mesh Generator ◽  
Generation Algorithm ◽  
Essential Input

Abstract This paper presents a finite element mesh generation algorithm (PREPAT) designed to automatically discretize two-dimensional domains. The mesh generation algorithm is a mapping scheme which creates a uniform isoparametric FE model based on a pre-partitioned domain of the component. The proposed algorithm provides a faster and more accurate tool in the pre-processing phase of a Finite Element Analysis (FEA). A primary goal of the developed mesh generator is to create a finite element model requiring only essential input from the analyst. As a result, the generator code utilizes only a sketch, based on geometric primitives, and information relating to loading/boundary conditions. These conditions represents the constraints that are propagated throughout the model and the available finite elements are uniformly mapped in the resulting sub-domains. Relative advantages and limitations of the mesh generator are discussed. Examples are presented to illustrate the accuracy, efficiency and applicability of PREPAT.

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