New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Find Voronoi cell and neighbors #51
Comments
I’m asking about the Voronoi cell and it’s neighbors, not the Delaunay triangle at a point. Is there a simple way to go from Delaunay triangle and neighbors to Voronoi? |
The Voronoi is the dual of the Delaunay, so the tasks are equivalent. So, the closest point to a given location [x, y] returned by delaunay.find is the Voronoi cell that contains that point. And given a point i, delaunay.neighbors returns the connected points on the Delaunay triangulation, which are also the adjacent Voronoi cells. |
Got it, I wasn’t sure if the Voronoi indices matched the Delaunay indices. Thanks! |
Is there a way to find the voronoi cell covering a point? And once you have a cell, is there a way of getting all the neighboring cells?
The text was updated successfully, but these errors were encountered: