This playground allows to try the different concepts connected with the Delaunay triangulation for a given set of points, which is a unique set of triangles dividing the plane with the given points. Its construction is defined in a way that no point lies in the circumcircle of the triangles, effectively leading to maximize the minimal angle of all triangles (avoiding triangels with acute angles).

Interesting is the connection of the Delaunay triangulation to the Voronoi diagram of these points, as the centers of the circumcircles are the vertices of the Voronoi diagram.

Two more concepts are connected with the Delaunay triangulation: the Relative neighborhood graph (RNG) and the Euclidean minimum spanning tree.

The RNG is a subgraph of the Delaunay triangulation and connects the points in a way that for every pair of points there is no other point closer to both. To some extent this mimics what our eyes perceive as the Gestalt produced by the points.

The EMST again is a subgraph of the RNG - the subgraph that minimizes the length of all edges while still connecting all the points.

The various sliders allow to fade the different concepts in and out, in order to visually understand the connections.

There are also a sliders to change the number of points and to control the speed of the (random) movement.

Various preset buttons are available to hightlight the concepts quickly (plus two more *fun* settings).

Note also that one can move the points manually with the mouse by dragging, easiest while the movement is slow respectively paused.