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

find a better performing solution to extract best path from voronoi diagram #3

Open
ungarj opened this issue Jun 20, 2016 · 0 comments
Open

find a better performing solution to extract best path from voronoi diagram #3

ungarj opened this issue Jun 20, 2016 · 0 comments

Comments

@ungarj
Copy link
Owner

ungarj commented Jun 20, 2016

Currently, the "best path" (a mixture of length and angle sum) is determined by converting the voronoi diagram to a networkx graph. Then, every possible path within this graph is analyzed.

This step takes the most time when generating the centerline. It depends on the number of points generated after segmentation and can easily take up to several minutes for larger polygons.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ungarj