Prof. Dr. Jay Martin Anderson
Professor Emeritus of Computer Science, Franklin & Marshall College
  • home
  • Development
    • Gallery
    • Stop and Pray
    • Stations at St. Thomas
    • PricePer
    • What's It Cost?
    • my own
    • at F&M
    • for clients
  • Small Gallery
  • LVC
  • Visualization
    • Algorithm Visualization >
      • Binary Space Partition
      • Convex Hull >
        • Extreme Point algorithm
        • Extreme Edge algorithm
        • "Gift Wrap" algorithm
        • Incremental algorithm
        • Incremental algorithm in three dimensions
        • "QuickHull" algorithm
      • Delaunay triangulation >
        • Incremental algorithm
        • from the Voronoi diagram
      • Line intersection >
        • a "brute force" algorithm
        • Sweepline algorithm
      • Motion planning
      • Point-in-Polygon >
        • Plumbline algorithm
        • Trapezoidal Map
        • Winding Number
      • Polygon triangulation >
        • "Art Gallery" Problem
        • Recursive algorithm
        • Make Monotone Polygons
        • Triangulate a Monotone Polygon
      • Voronoi diagram >
        • Fortune's algorithm
        • Intersection of Half-Planes
        • Quadtree algorithm
    • Data Visualization
  • OpenGL
    • OpenGL for Apple Software Developers
  • iBooks
  • about me
    • contact
Delaunay Triangulation:  from the Voronoi Diagram
Picture
The Delaunay triangulation of a set of points in the plane divides the plane into a number of triangles, plus one open figure.  The set of triangles is the "best" in the sense that:

  • one couldn't add another triangle without going out of the plane;

  • the triangles maximize their smallest angle; that is, the triangles avoid being long and skinny.

The Delaunay triangulation leaves an open figure, which is the inverse of the convex hull.  That is, the outermost edges of the triangles form the convex hull of the points.

The Delaunay triangulation is also the dual of the Voronoi diagram of these points. An edge of the triangulation maps to an edge of the diagram; a triangle maps to a Voronoi vertex; a vertex of the triangulation maps to a Voronoi cell. 

This is the algorithm which is illustrated here.  We begin with the Voronoi diagram of the set of points, and from it construct the Delaunay triangulation.  The Voronoi diagram is computed by the intersecting half-plane algorithm; then, an edge of the Voronoi diagram is removed and the corresponding Delaunay edge is inserted.  A Voronoi edge separates two points; the Delaunay edge connects them.

Click the Download button at the right to download a zipped file of all movies described on this page.
download
Proudly powered by Weebly