A video generated by a processing.org sketch, which demonstrates: animated Delaunay triangulation and the corresponding dual graph, a Voronoi diagram. The colors and idea were inspired by the wikipedia entry for 'Delaunay triangulation'. The triangles for a set of points will be described by a circle that touches only 3 vertices and the circle will contain no other points within it. The centers of these 'circumcircles' are the corners of Voronoi cells. The previously described vertices represent voronoi 'sites' which exist inside these cells. All the cell borders are perpendicular to the neighboring sites. The processing sketch could not have been written as easily without trickl.com's graph package which in turn uses the JGraphT.org library. All the animations are driven by Benedikt Groß' excellent Ani package for processing. FFMpeg was used to encode the video directly from the pixels array because processing's movie maker library doesn't work well. Processing 1.5.1 was used because processing 2 seemed to break existing sketches.