Delaunay triangulation

views updated

Delaunay triangulation A recursive algorithm for splitting an area into triangles that ensures that the circle circumscribing the vertices of a triangle contains the vertices of no other triangle within it. This avoids long thin triangles, for example. See also triangulation.

About this article

Delaunay triangulation

Updated About encyclopedia.com content Print Article