Bowyer–Watson algorithm
= Bowyer–Watson algorithm
{wiki=Bowyer–Watson_algorithm}
The Bowyer-Watson algorithm is a computational geometry algorithm used to incrementally construct a Delaunay triangulation of a set of points in a two-dimensional space. A Delaunay triangulation maximizes the minimum angle of the triangles formed, avoiding skinny triangles and ensuring better numerical stability for applications such as mesh generation and interpolation.