Explore: Voronoi Polygons

Peter Gustav Lejeune Dirichlet). Voronoi cells are also known as Thiessen polygons, after Alfred H. Thiessen. Voronoi diagrams have practical and theoretical

for the entire texture. This results in each texel centroid having a Voronoi polygon surrounding it, which consists of all points that are closer to its

of regular polygons, the most common notation is the vertex configuration, which is simply a list of the number of sides of the polygons around a vertex

identical. In this case the Voronoi diagram contains vertices of degree four or greater and its dual graph contains polygonal faces with four or more sides

electrical engineering and computer science, Lloyd's algorithm, also known as Voronoi iteration or relaxation, is an algorithm named after Stuart P. Lloyd for

and the Voronoi Diagram (1908), apparently had never been used in meteorology for interpolation of measurements. The synonyms Thiessen polygons or Thiessen

the orthogonal convex hull, convex layers, Delaunay triangulation and Voronoi diagram, and convex skull. A set of points in a Euclidean space is defined

in this case. For instance, the Voronoi diagram of a finite set of point sites is a partition of the plane into polygons within which one site is closer

antiprism) have regular skew hexagons as petrie polygons. The regular skew hexagon is the Petrie polygon for these higher dimensional regular, uniform and

domain for Γ is given by a convex polygon for the hyperbolic metric on H. These can be defined by Dirichlet polygons and have an even number of sides.