1990•Journal of Computing in Civil EngineeringRequires access

Automatic Mesh Generator for Use in Two‐Dimensional h‐p Analysis

Marcel K. Georges, Mark S. Shephard

Open publisher page 5 citations

Abstract

Paper presents a fully automatic mesh generator specifically designed to create the coarse, exponentially graded meshes needed for the optimal application of the h‐p version of the finite element method. The mesh generator interrogates the boundary representation of the domain and searches for topological entities that can be carved off one at a time until the domain is reduced to one remaining acceptable element. The meshing algorithm employs a set of element‐removal operators, that are applied in a hierarchic manner. The removal of an element at any step considers its influence on future removal‐operation choices. The mesh generator can also perform mesh refinements as indicated by an h‐p version adaptive analysis procedure. The results demonstrate the ability of the mesh generator to create meshes of controlled‐shape elements that meet the requirements of the h‐p version of the finite element method.

About this research paper

What this paper is about

Paper presents a fully automatic mesh generator specifically designed to create the coarse, exponentially graded meshes needed for the optimal application of the h‐p version of the finite element method. The mesh generator interrogates the boundary representation of the domain and searches for topological entities that can be carved off one at a time until the domain is reduced to one remaining acceptable element. The meshing algorithm employs a set of element‐removal operators, that are applied in a hierarchic manner. The removal of an element at any step considers its influence on future removal‐operation choices. The mesh generator can also perform mesh refinements as indicated by an h‐p version adaptive analysis procedure. The results demonstrate the ability of the mesh generator to create meshes of controlled‐shape elements that meet the requirements of the h‐p version of the finite element method.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Paper presents a fully automatic mesh generator specifically designed to create the coarse, exponentially graded meshes needed for the optimal application of the h‐p version of the finite element method. The mesh generator interrogates the boundary representation of the domain and searches for topological entities that can be carved off one at a time until the domain is reduced to one remaining acceptable element. The meshing algorithm employs a set of element‐removal operators, that are applied in a hierarchic manner. The removal of an element at any step considers its influence on future removal‐operation choices. The mesh generator can also perform mesh refinements as indicated by an h‐p version adaptive analysis procedure. The results demonstrate the ability of the mesh generator to create meshes of controlled‐shape elements that meet the requirements of the h‐p version of the finite element method.

Key concepts: Polygon mesh, Generator (circuit theory), Finite element method, Mesh generation, Boundary (topology), Representation (politics), Computer science, Domain (mathematical analysis)

Related papers

Back to paper searchBrowse research topicsOriginal source
Automatic Mesh Generator for Use in Two‐Dimensional h‐p Analysis — Research Paper | ScholarLens