k-order Voronoi diagrams of points decompose the plane in regions such that all points in the region are closer to k points than to all the other points.
Note that with a large value for k, the diagram is the furthest point Voronoi diagram.
| Functionality: | incremental. Changing the value of k triggers a recomputation. |
| Robustness: | research prototype |
| License: | QPL, commercial |
| Developed by: | INRIA |
|
|
|
