Convex and discrete geometry Lattices and geometry of numbers Concept
Voronoi cell
Summary
Let be a discrete set of points in . The Voronoi cell of is the set of points that are no farther from than from any other point of . The Voronoi cells of the points of cover space and meet only along their boundaries. For a lattice, all cells are translates of the cell of the origin. This cell is a centrally symmetric convex polytope whose volume is the covolume of the lattice. Voronoi cells of lattices are central in lattice packing and covering, in quantization and in decoding.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | V1R1R88GV6 |
|---|---|
| URI | m2://V1R1R88GV6 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C07, 11H06, 52C22 |
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.