Convex and discrete geometry Definition
Voronoi cell
Builds on Euclidean distanceLattice (group)
Definition
Let be a nonempty set with no accumulation point, and let denote the Euclidean distance. The Voronoi cell of a point is If is a lattice in , the Voronoi cell of is the cell of the origin in .
Remarks
Each condition defines a closed half-space, so is a closed convex set. Example: for , the cell is . Indeed, for and gives and , and these four conditions imply the others. Non-example: the closed square is not the Voronoi cell of in , because its point is at distance from and at distance from . For a lattice , the cell is a convex polytope, symmetric about , its translates with cover with disjoint interiors, and its volume equals . The cells of all points of form the Voronoi diagram of .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean distance concept
- Lattice (group) concept
- Voronoi cell definition
Further reading
About this page
| Tag | ZQR56X168K |
|---|---|
| URI | m2://ZQR56X168K |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52C07, 11H06, 52C22 |
| Defines | Voronoi cell |
| Uses | Euclidean distance, Lattice (group) |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.
What links here
No page links to this page yet.