Q-Morph - Implementing a Quadrilateral Meshing Algorithm

This thesis treats the implementational and some theoretical aspects of the Q-Morph algorithm for 2D domains. The main application areas are within FE methods. Q-Morph uses an advancing front method for generating unstructured, almost all-quadrilateral meshes containing at most one triangle, and few irregular nodes. The main algorithm is described in (1), while the post-processing methods are covered in (2,3). In addition to an introduction to the Q-Morph algorithm, the thesis also consists of some general background material for FEM meshing, discussions of many issues concerning the implementation, a presentation of important results, and a discussion of possible improvements. To ensure that the implementation conforms to the specifications of the algorithm, it has been tested on a number of different cases. 1) S.J. Owen, M.L. Staten, S.A. Canann, S.Saigal: Advancing Front Quadrilateral Meshing Using Triangle Transformations, 1998 2) P. Kinney: CleanUp: Improving Quadrilateral Finite Element Meshes, 1997 3) 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, 199