|
|
| (One intermediate revision by one user not shown) |
| Line 3: |
Line 3: |
| | |Definition=1. A Voronoi diagram is a subdivision of space. | | |Definition=1. A Voronoi diagram is a subdivision of space. |
| | 2. The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to its generating point than to any other.(mathematics) | | 2. The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to its generating point than to any other.(mathematics) |
| − | |Sources=https://en.wikipedia.org/wiki/Voronoi_diagram; http://mathworld.wolfram.com/VoronoiDiagram.html | + | |Sources=https://en.wikipedia.org/wiki/Voronoi_diagram; http://mathworld.wolfram.com/VoronoiDiagram.html |
| | }} | | }} |
| | [http://stackoverflow.com/questions/tagged/voronoi http://stackoverflow.com/questions/tagged/voronoi] | | [http://stackoverflow.com/questions/tagged/voronoi http://stackoverflow.com/questions/tagged/voronoi] |
Latest revision as of 07:29, 16 November 2017
[edit] Definition
1. A Voronoi diagram is a subdivision of space.
2. The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to its generating point than to any other.(mathematics)
[edit] Abbreviation
[edit] Synonyms
Dirichlet tessellation
[edit] Superterms
[edit] Subterms
[edit] Sources
https://en.wikipedia.org/wiki/Voronoi_diagram; http://mathworld.wolfram.com/VoronoiDiagram.html
http://stackoverflow.com/questions/tagged/voronoi
