Efficient and good Delaunay meshes from random points

► Conforming Delaunay triangulation algorithm based on maximal Poisson-disk sampling. ► Angles between 30° and 120°. ► Two-dimensional non-convex domains with holes, planar straight-line graphs. ►O(n) space, E(nlogn) time; efficient in practice. Background squares ensure all computations are local.