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

Visibility graph calculation is very slow for large polygon set #4

Open
dhivehi opened this issue Dec 17, 2019 · 0 comments
Open

Visibility graph calculation is very slow for large polygon set #4

dhivehi opened this issue Dec 17, 2019 · 0 comments

Comments

@dhivehi
Copy link

dhivehi commented Dec 17, 2019

Visibility graph can be optimized by removing unneeded lines.
If both ends of a line is tangent to a polygon, then it's needed. Else it is not needed.
Please make a way to check if p1 and p2 are tangent to a polygon before adding to visibility graph as it would make visibility graph generation multiple times faster.

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

No branches or pull requests

1 participant