This thesis treats the implementational and some theoretical aspectsof the Q-Morph algorithm for 2D domains. The main applicationareas are within FE methods. Q-Morph uses an advancing front methodfor generating unstructured, almost all-quadrilateral meshescontaining at most one triangle, and few irregular nodes. The mainalgorithm is described in (1), while the post-processingmethods are covered in (2,3).
In addition to an introduction to the Q-Morph algorithm, the thesisalso consists of some general background material for FEM meshing,discussions of many issues concerning the implementation, apresentation of important results, and a discussion of possibleimprovements. To ensure that the implementation conforms to thespecifications of the algorithm, it has been tested on a number ofdifferent cases.
1) S.J. Owen, M.L. Staten, S.A. Canann, S.Saigal: Advancing Front Quadrilateral Meshing Using Triangle Transformations, 19982) P. Kinney: CleanUp: Improving Quadrilateral Finite Element Meshes, 19973) S.A. Canann, J.R. Tristano, M.L. Staten: An Approach to Combined Laplacian and Optimization-Based Smoothing for Triangular Quadrilateral and Quad-Dominant Meshes, 1998