Statements (53)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Dirichlet_tessellation
gptkb:Thiessen_polygons |
| gptkbp:application |
gptkb:astronomy
cellular networks computer graphics crystallography ecology geology meteorology robotics urban planning spatial analysis |
| gptkbp:complexity |
O(n log n) in 2D
|
| gptkbp:defines |
partitioning of a plane into regions based on distance to a set of points
|
| gptkbp:dimensions |
can be defined in any dimension
|
| gptkbp:field |
gptkb:geometry
gptkb:mathematics biology geography physics |
| gptkbp:firstDescribed |
1908
|
| gptkbp:generalizes |
gptkb:Dirichlet_tessellation
|
| https://www.w3.org/2000/01/rdf-schema#label |
Voronoi diagrams
|
| gptkbp:namedAfter |
gptkb:Georgy_Voronoy
|
| gptkbp:property |
each region contains all points closer to one seed than to any other
boundaries are equidistant from two or more seeds regions are convex polygons in 2D |
| gptkbp:relatedTo |
gptkb:Gabriel_graph
gptkb:Laguerre_diagram gptkb:additively_weighted_Voronoi_diagram gptkb:relative_neighborhood_graph convex hull Delaunay triangulation multiplicatively weighted Voronoi diagram power diagram proximity graph spatial partitioning spatial tessellation |
| gptkbp:supportsAlgorithm |
gptkb:Fortune's_algorithm
divide and conquer incremental construction |
| gptkbp:usedIn |
path planning
image segmentation data clustering nearest neighbor search spatial interpolation spatial partitioning |
| gptkbp:visualizes |
colored regions around points
|
| gptkbp:bfsParent |
gptkb:Leonidas_J._Guibas
gptkb:Computational_geometry gptkb:Discrete_geometry |
| gptkbp:bfsLayer |
5
|