Provably good mesh generation (Q1329150)

It is shown how to triangulate a planar point set with (a) triangles of bounded aspect ratio, (b) triangles having no obtuse angles, (c) how to triangulate a point set of arbitrary dimension with simplices of bounded aspect ratio, and (d) how to produce a linear-size Delaunay triangulation of a multidimensional point set by adding a linear number of extra points. All the triangulations have optimal size within a constant factor and run in optimal time.