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.

Sign up for GitHub

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

Jump to bottom

Optimize Delaunay Triangulation #5

Open
joshheinrichs opened this issue May 11, 2015 · 0 comments
Open

Optimize Delaunay Triangulation #5

joshheinrichs opened this issue May 11, 2015 · 0 comments
Labels
optimization

Comments

@joshheinrichs
Copy link
Owner

Currently using a O(n^4) algorithm. Would be nice to reduce this to at least O(n^2) using an unoptimized incremental algorithm. However, since this program doesn't really have a need beyond ~30 points, this is low priority.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
optimization
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@joshheinrichs