AGlobal Minimization-Based, Automatic Quadrilateral Meshing Algorithm
Wolfenbarger, Paul, Joseph Jung, Clark R. Dohrmann, Walter R. Witkowski, Malcolm J. Panthaki, Walter H. Gerstle
Proceedings, 7th International Meshing Roundtable, Sandia National Lab, pp.87-103, October 1998
7th International Meshing Roundtable
October 26-28, 1998
Dearborn, Michigan, USA
Paul Wolfenbarger (pwolfencarc.unm.edu)
Joseph Jung (email@example.com)
Clark R. Dohrmann (crdohrmcsandia.gov)
Walter R. Witkowski (firstname.lastname@example.org)
Malcolm J. Panthaki(email@example.com)
Walter H. Gerstle (firstname.lastname@example.org)
A novel method is presented for automatically generating quadrilateral
meshes on arbitrary two-dimensional domains. Global minimization of a
potential function governs mesh formation and characteristics.
Comprised of several terms, the potential function distributes the
elements throughout the domain and aligns the edges of the elements to
form valid connectivities. If there are any remaining unlinked element
edges, the local connectivity is examined and a "hole elimination"
algorithm is applied that successively finds alternative
connectivities. Unlinked edges, representing holes in the mesh, are
moved to either coalesce, or to a boundary. The components of the
potential, the minimization procedure, and the connectivity refinement
algorithm are presented. The method shows promise for extension to
automatic three-dimensional hexahedral meshing.
Initial conditions required to ensure mesh closure include an even
number of elements on the boundary and a closed boundary. The desired
mesh characteristics are programmed into the algorithm. A Poisson's
solution scheme is utilized to generate a better initial placement,
density, size and orientation of elements, leading to faster and more
robust mesh closure. A number of example geometries have been meshed.
Download Full Paper (PDF)
Contact author(s) or publisher for availability and copyright information on above referenced article