This package provides an implementation of the Bowyer Watson triangulation algorithm to iteratively triangulate a set of points. This algorithm is not as efficient as other triangulation algorithms (such as ear clipping) but it has the advantage that the points do not have to known a priori. This is particularly useful in cases where the triangulation itself decides which point to insert next.
You can find some examples in the examples directory.
