About Delaunay triangulation

In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles whose circumcircles do not contain any of the points; that is, each circumcircle has its generating points on its circumference, but all other points in the set are outside of it. This maximizes the size of the smallest angle in any of the triangles, and tends to avoid sliver triangles.

members

Facts from Wikidata (CC0). Image by Hferee via Wikimedia Commons (Public domain).

Delaunay triangulation

triangulation method named after Boris Delaunay

0members1here now

Ask Genius Site

Site Journal

Feed Discussions About

Sort by

Content type

Latest Delaunay triangulation news and discussion

Sort by

Content type

Nothing published yet

The conversation starts anyway — post the first discussion above.