ABSTRACT
Finite element (FE) mesh generation (MG) probably started its journey from the discretisation of a bounded region on a planar domain. Many MG algorithms, including the mapping method, Delaunay triangulation (DT), Quadtree decomposition, advancing-front approach, etc., had their ideas and development found first on two dimensions. This is a long chapter as all the basic concepts and ideas in FE MG will be fully explained and illustrated with examples. Following the classification in Section 2.3.5, the MG schemes developed on 2D domains can be classified into structured and unstructured meshing methods.
