This is a representation of the Delaunay triangulation of a set of points. At each step of the simulation, a new point is added to the set of points, and the triangulation is updated. Setting the speed to minimum allows you to manually step through the simulation, and setting it to maximum skips to the final triangulation.
This is implemented with the Bowyer-Watson algorithm. I am simply using this to produce a nice-ish looking planar graph.
The red dot and triangles are the corresponding elements being updated in the current step. The pink dot is the next point to be added to the set of points. The edges moving off the screen are connected to the super triangle.