It is often used to build meshes for finite element computer codes.
This is the dual of the Voronoi diagram in R2 [R2] and is defined as the triangulation of a set of points such that no other point is inside the circumcircle of a triangle. The Euclidean minimum spanning tree of a set of points is a subset of this triangulation of the same points. It is often used to build meshes for finite element computer codes.
This is the dual of the Voronoi diagram in R2 [R2] and is defined as the triangulation of a set of points such that no other point is inside the circumcircle of a triangle.
{Delaunay} triangulation