Voronoi diagrams deal with a set of objects or sites, by splitting a plane into areas connected to a particular site. There are many forms of Voronoi diagrams employing different types of criteria/boundaries and one such type is the furthest point Voronoi diagram.
This website is designed as an application to aid in the teaching, presentation and study of these diagrams. Contained within this site we discuss what these diagrams are in further detail and how they are calculated. The Java applet not only demonstrates these diagrams, but it can also animate the algorithms employed in their calculation.
How the Diagrams are Calculated
Other Sites on Computational Geometry