This article has multiple issues. Please help or discuss these issues on the talk page. (Learn how and when to remove these template messages)
This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help by introducing citations to additional sources. Find sources: – ···scholar·JSTOR(May 2019)
The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources: – ···scholar·JSTOR(May 2019) (Learn how and when to remove this template message)
This article needs attention from an expert in mathematics. See the talk page for details. WikiProject Mathematics may be able to help recruit an expert.(May 2019)
(Learn how and when to remove this template message)
In geometry, the positive and negative Voronoi poles of a cell in a Voronoi diagram are certain vertices of the diagram.
Definition[]
Let be the Voronoi diagram for a set of sites , and let be the Voronoi cell of corresponding to a site . If is bounded, then its positive pole is the vertex of the boundary of that has maximal distance to the point . If the cell is unbounded, then a positive pole is not defined.
Furthermore, let be the vector from to the positive pole, or, if the cell is unbounded, let be a vector in the average direction of all unbounded Voronoi edges of the cell. The negative pole is then the Voronoi vertex in with the largest distance to such that the vector and the vector from to make an angle larger than .
Example[]
Here is the positive pole of and its negative. As the cell corresponding to is unbounded only the negative pole exists.
References[]
Boissonnat, Jean-Daniel (2007). Effective Computational Geometry for Curves and Surfaces. Berlin: Springer. ISBN978-3-540-33258-9.
Categories:
Computational geometry
Hidden categories:
Articles needing additional references from May 2019
All articles needing additional references
Articles with topics of unclear notability from May 2019