Hexagonal Delaunay Triangulation

We present a novel and robust algorithm for triangulating point clouds in R-2. It is based on a highly adaptive hexagonal subdivision scheme of the input domain. That hexagon mesh has a dual triangular mesh with the following properties: any angle of any triangle lies in the range between 43.9 degrees and 90 degrees, the aspect ratio of triangles is bound to 1.20787, the triangulation has the Delaimay property, the minimum triangle size is bounded by the minimum distance between input points. The iterative character of the hexagon subdivision allows incremental addition of further input points for selectively refining certain regions. Finally we extend the algorithm to handle planar straight-line graphs (PSLG). Meshes produced by this method are suitable for all kinds of algorithms where numerical stability is affected by triangles with skinny or obtuse angles.