Voronoi Diagram

The partitioning of a plane with points into convex Polygons such that each Polygon containsexactly one point and every point in a given Polygon is closer to its central point than to any other. AVoronoi diagram is sometimes also known as a Dirichlet Tessellation. The cells are called DirichletRegions, Thiessen Polytopes, or Voronoi Polygons.

References

Eppstein, D. ``Nearest Neighbors and Voronoi Diagrams.''http://www.ics.uci.edu/~eppstein/junkyard/nn.html.

• Psi Function
• p-Signature
• PSLQ Algorithm
• PSOS Algorithm
• P-Symbol
• Ptolemy Inequality
• Ptolemy's Theorem
• Public-Key Cryptography
• Puiseaux's Theorem
• Pullback Map
• Pulse Function
• Purser's Theorem
• Pursuit Curve
• Push
• Puzzle
• P-Value
• Pyramid
• Pyramidal Frustum
• Pyramidal Number
• Pyritohedron
• Pythagoras's Constant
• Pythagoras's Theorem
• Pythagoras Tree
• Pythagorean Fraction
• Pythagorean Quadruple