ABSTRACT
Given a geometric domain, the mesh generation problem is to partition it into a set of simple (non-overlapping) cells. Various properties on the partition, such as the size, shape, or the number of cells, may be required. Algorithms are needed which generate such meshes from arbitrary domains in optimal time. This chapter considers the development of meshing algorithms which partition the underlying domain into simplices.
