Voronoi diagrams and Delaunay triangulations

delauney.jpg A possible random Delaunay triangulation (screenshot from the applet)

Just a link to an instructive applet on Voronoi diagrams and Delaunay triangulations as appearing in computational geometry.

From the site:

  • The Voronoi Diagram has the property that for each site (clicked with the mouse) every point in the region around that site is closer to that site than to any of the other sites.
  • The Delaunay Triangulation is the geometric dual of the Voronoi Diagram. Alternately, it can be defined as a triangulation of the sites with the additional property that for each triangle of the triangulation, the circumcircle of that triangle is empty of all other sites.

In the above applet the user can switch between the two constructions.

->Another Delaunay triangulation application (java webstart) from Markus.

Leave a Reply

The below box is for leaving comments. Interesting comments in german, french and russian will eventually be translated into english. If you write a comment you consent to our data protection practices as specified here. If your comment text is not too rude and if your URL is not clearly SPAM then both will be published after moderation. Your email adress will not be published. Moderation is done by hand and might take up to a couple of days.
you can use LaTeX in your math comments, by using the [latex] shortcode:
[latex] E = m c^2 [/latex]