Dirichlet tessellation | Voronoi tessellation

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to its generating point than to any other. A Voronoi diagram is sometimes also known as a Dirichlet tessellation. The cells are called Dirichlet regions, Thiessen polytopes, or Voronoi polygons.

art gallery theorem | computational geometry | convex hull | Delaunay triangulation | medial axis | triangulation | Voronoi polygon