Biting: advancing front meets sphere packing

A key step in the nite element method is to generate a high-quality mesh that is as small as possible for an input domain. Several meshing methods and heuristics have been developed and implemented. Methods based on advancing front, Delaunay triangulations, and quadtrees=octrees are among the most popular ones. Advancing front uses simple data structures and is e cient. Unfortunately, in general, it does not provide any guarantee on the size and quality of the mesh it produces. On the other hand, the circle-packing-based Delaunay methods generate a well-shaped mesh whose size is within a constant factor of the optimal. In this paper, we present a new meshing algorithm, the biting method, which combines the strengths of advancing front and circle packing. We prove that it generates a high-quality 2D mesh, and the size of the mesh is within a constant factor of the optimal