Delaunay Algorithm

Grasshopper has a great Delaunay/Voronoi tool. At some point, however, I felt like really understanding the algorithm and set out to make my own. The only thing I took in consideration was the basic principle of Delaunay triangulation, namely, as Wikipedia puts it: "a Delaunay triangulation for a set P of points in a plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P)"

With that, I figured out a 2D algorithm to generate the field of triangles from a set of random points. I created the code in Processing and you can run and download it from here:

http://solvengineer.com/delaunay.html

Enjoy!

Mihai Pruna