BowyerNone

Bowyer–Watson is an algorithm used in computational geometry for efficiently constructing a Delaunay triangulation from a set of points. The “Bowyer–None” method iteratively adds each point to an existing triangulation by first identifying all triangles whose circumcircles contain that point, called the "bad triangles." These are then removed, creating a cavity. The algorithm then retriangulates this hole by connecting the new point to the boundary of the cavity, resulting in an updated Delaunay triangulation. This process is repeated for all points, producing a triangulation that maximizes the minimum angles, which is useful in mesh generation and spatial analysis.