Click to add point
Click and drag to add + move point
Computes the Delaunay Triangulation of a set of points using the incremental algorithm. The algorithm can run in O(n log n) but mine takes some short cuts and does not run as efficient. It does not (currently) implement a Delaunay Tree, which makes searching for triangles faster.
Here is a detailed post I made:
For references see:
http://users.aims.ac.za/~faniry/documents/faniry.pdf (Mostly section 4)