Math 2.0

Convex and discrete geometry Lattices and geometry of numbers Concept

Voronoi cell

Summary

Let SS be a discrete set of points in ℝn\R^n. The Voronoi cell of p∈Sp \in S is the set of points that are no farther from pp than from any other point of SS. The Voronoi cells of the points of SS 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

  1. Web https://en.wikipedia.org/wiki/Voronoi_diagram
About this page
TagV1R1R88GV6
URIm2://V1R1R88GV6
Kindconcept
WritingW0 stub
MSC52C07, 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.

What links here

Used by

Definitions