# What Is Voronoi Diagram

**How can we efficiently create it.**

**What is voronoi diagram**.
We frequently need to find the nearest hospital surgery or supermarket.
Let p be the set of ndistinct site points in the plane.
Voronoi diagram with ten seed points.

A voronoi diagram is sometimes also known as a dirichlet tessellation. As noted they help understand proximity and distance of features. Voronoi diagram the partitioning of a plane with 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.

That set of points called seeds sites or generators is specified beforehand and for each seed there is a corresponding region consisting of all points closer to that seed than to any other. Voronoi diagrams are not just pretty pictures. In mathematics a voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane.

A voronoi diagram divides the space into voronoi cells reg p for some p if reg p is a strange shape hard to figure out if the query is inside reg p fortunately as the picture suggests voronoi cells have simple. A voronoi diagram is a simple concept and it s based on the minimal distance needed to reach a landmark. A voronoi diagram is sometimes also known as a dirichlet tessellation.

Georgy voronyi is the creator of the voronoi diagram. An example with ten seed points is shown in figure 1. Voronoi diagram the partitioning of a plane with 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.

If you need to go to a metro station the most natural algorithm is going to the nearest one. How can we use it once we ve got it. In mining they can aid estimation of mineral resources based on exploratory drill holes.