{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "AMC3JCQ497"
    },
    {
      "field": "uses",
      "target": "SGH803FGY4"
    }
  ],
  "body": "\n## Summary\n\nThe Voronoi diagram of a finite set of points, the sites, divides space into cells, one for each site.\nThe cell of a site consists of the points that are at least as close to it as to any other site.\nVoronoi diagrams are a basic structure of computational geometry, with uses in nearest-neighbour search, mesh generation and the geometry of numbers.\n\n## Explanations\n\n### L1 human\n\nImagine a few post offices in a town, and assign every house to its nearest post office.\nThe regions that you get are the cells of the Voronoi diagram.\nFor two sites the dividing line is the perpendicular bisector of the segment between them.\nFor more sites each cell is a convex polygon, possibly unbounded, bounded by pieces of such bisectors.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "52C99",
      "68U05"
    ],
    "name": "Voronoi diagram",
    "same_as": {
      "wikidata": "Q757267",
      "wikipedia": "Voronoi diagram"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Voronoi_diagram"
      }
    ],
    "tag": "QDNEBBVZ84"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/QDNEBBVZ84/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/QDNEBBVZ84.md",
  "msc": [
    "52C99",
    "68U05"
  ],
  "name": "Voronoi diagram",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/QDN/QDNEBBVZ84.md",
  "status": null,
  "tag": "QDNEBBVZ84",
  "uri": "m2://QDNEBBVZ84",
  "url": "https://tamnd.github.io/math2/wiki/voronoi-diagram/",
  "writing": {
    "tag": "QDNEBBVZ84",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}