Skip to content
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

Select between non-unique Delaunay Triangulations #21

Open
joshheinrichs opened this issue Jun 5, 2015 · 0 comments
Open

Select between non-unique Delaunay Triangulations #21

joshheinrichs opened this issue Jun 5, 2015 · 0 comments
Labels

Comments

@joshheinrichs
Copy link
Owner

In both poor delaunay vs. straight line distance examples that were given in On plane geometric spanners: A survey and open problems, there were groupings of cocircular points, with certain poor arrangements of edges.

Currently, the edges are blindly selected with no regard to the Delaunay distance.

I'm not sure what the algorithmic complexity involved would be in finding the worst edge arrangement (n! in worst case, maybe better?), but at the very least, there should be settings or tools to allow the user to select between non-unique delaunay triangulations.

My first thought is to add a setting which at first generates all edges, and then allows the user to select the edges that they want to keep, or maybe adding a setting that automatically generates the worst case, just in n! time, so it should be disabled when analysis is not occurring.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant