You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I recently stumbled upon the interesting concept of a k-order Voronoi diagram (also called k-nearest neighbor Voronoi diagram in some papers, see [1] for details). I was wondering if anyone found a relatively simple way to extend the methods provided by this library to generate such a higher-order diagram.
Lee's sequential algorithm [1] that transforms the Voronoi diagram of order k into the diagram of order k+1 came to mind after some digging. Since this library leverages good performance and nice ways to incorporate interactivity, I was wondering if there are any relatively simple ways to generate this k-order Voronoi diagram using this library.
[1] Lee, D. T. (1982). On k-nearest neighbor Voronoi diagrams in the plane. IEEE transactions on computers, 100(6), 478-487.
The text was updated successfully, but these errors were encountered:
Cystom
changed the title
Generating a k-order Voronoi diagramFeb 12, 2020
Hi there,
I recently stumbled upon the interesting concept of a k-order Voronoi diagram (also called k-nearest neighbor Voronoi diagram in some papers, see [1] for details). I was wondering if anyone found a relatively simple way to extend the methods provided by this library to generate such a higher-order diagram.
Lee's sequential algorithm [1] that transforms the Voronoi diagram of order k into the diagram of order k+1 came to mind after some digging. Since this library leverages good performance and nice ways to incorporate interactivity, I was wondering if there are any relatively simple ways to generate this k-order Voronoi diagram using this library.
[1] Lee, D. T. (1982). On k-nearest neighbor Voronoi diagrams in the plane. IEEE transactions on computers, 100(6), 478-487.
The text was updated successfully, but these errors were encountered: