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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call