Convex and discrete geometry Tilings Concept
Voronoi diagram
Summary
The Voronoi diagram of a finite set of points, the sites, divides space into cells, one for each site. The cell of a site consists of the points that are at least as close to it as to any other site. Voronoi diagrams are a basic structure of computational geometry, with uses in nearest-neighbour search, mesh generation and the geometry of numbers.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | QDNEBBVZ84 |
|---|---|
| URI | m2://QDNEBBVZ84 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C99, 68U05 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.