Voronoi polygon

Voronoi polygon

(mathematics, graphics)
For a member s of a set S of points in the Euclidean plane, the locus of points in the plane that are closer to s than to any other member of S.
Mentioned in ?
References in periodicals archive ?
Proximity polygon (or Voronoi polygon or nearest point) sets [z.
For a unknown-height location p (indicated With a triangle), we identify the corresponding closest subset by first adding p to the Voronoi diagram formed previously, and then find the set of points With their respective original Voronoi polygons overlapping with the Voronoi polygon of p.
The main disadvantage of this approach is its need for pre-computing and maintaining two different sets of data: 1) query to border computation: computing the network distances from q to the border points of its enclosing network Voronoi polygon, and 2) border to border computation: computing the network distances from the border points of NVP of q to the border points of any of the other NVPs.
We show that the split points on the path are simply the intersections of the path with the network Voronoi polygons (NVPs) of the network, which are a subset of the border points of the NVPs.
Our solution for restricted CNN queries is based on our previous work PINE that partitions the network into disjoint first order network Voronoi polygons (NVP) (Safar, 2005) in such a way that the first nearest neighbor of any point inside a polygon is the generator of that polygon.
Ten positions were computed along each border, and elevations were estimated at each position twice, once for the neighborhood of postings defined by each Voronoi polygon sharing that border.
This is not surprising because, if the neighborhoods share only one point, then their common border is on the convex hull of the Voronoi polygon defined by that neighborhood.
In the case of Voronoi nearest neighbors, the patches are Voronoi polygons.
Leach conditions to measure available Avl Al2O3 and reactive SiO2 Rx were 1g leached in 10ml of 90gpl NaOH at 143 degrees C for 30 minutes Estimation was done by a polygonal modelling using Voronoi polygons with a tightly defined resource boundary around the holes.
The cells are called Dirichlet regions, Thiessen polytopes, or Voronoi polygons.