Voronoi diagram (Wikipedia)

20 points and their Voronoi cells (larger version below)

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. 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. These regions are called Voronoi cells. The Voronoi diagram of a set of points is dual to its Delaunay triangulation.

It is named after Georgy Voronoi, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav Lejeune Dirichlet). Voronoi diagrams have practical and theoretical applications in a large number of fields, mainly in science and technology, but also in visual art.[1][2] They are also known as Thiessen polygons

Google Cloud for Startups program

Startups in our program have access to:

  • Google Cloud credits, free users on G Suite, Hire by Google (US only), Qwiklabs, and more
  • Special events, mentorship, and technical training
  • News and product updates

Qualified startups

  • Have received no more than a Series A funding round
  • Are less than five years old
  • Are based in an approved territory
  • Have not previously received Cloud credits outside of the free-tier offering

Startups who are part of an incubator or accelerator program, or have received VC funding, should check with that organization before applying here as they may be eligible for larger credit levels.