Higher-order Voronoi Diagrams
| This section may require cleanup to meet Wikipedia's quality standards. No cleanup reason has been specified. Please help improve this section if you can. |
Although a normal Voronoi cell is defined as the set of points closest to a single point in S, an nth-order Voronoi cell is defined as the set of points having a particular set of n points in S as its n nearest neighbors. Higher-order Voronoi diagrams also subdivide space.
Higher-order Voronoi diagrams can be generated recursively. To generate the nth-order Voronoi diagram from set S, start with the (n − 1)th-order diagram and replace each cell generated by X = {x1, x2, ..., xn−1} with a Voronoi diagram generated on the set S − X.
Read more about this topic: Voronoi Diagram
Famous quotes containing the word diagrams:
“Professors could silence me then; they had figures, diagrams, maps, books.... I was learning that books and diagrams can be evil things if they deaden the mind of man and make him blind or cynical before subjection of any kind.”
—Agnes Smedley (1890–1950)