We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
In OSM maps not all intersections are properly marked (even though streets overlap - see e.g. a map of La Plata, Argentina). We should add missing intersections by comparing street segments against each other. Note that this will require some computations and brute-forcing it wuould easily yield O(n²) (with n == number of nodes in the entire graph). See e.g. https://www.topcoder.com/community/data-science/data-science-tutorials/line-sweep-algorithms/ and http://www.geeksforgeeks.org/given-a-set-of-line-segments-find-if-any-two-segments-intersect/
The text was updated successfully, but these errors were encountered:
No branches or pull requests
In OSM maps not all intersections are properly marked (even though streets overlap - see e.g. a map of La Plata, Argentina). We should add missing intersections by comparing street segments against each other. Note that this will require some computations and brute-forcing it wuould easily yield O(n²) (with n == number of nodes in the entire graph). See e.g. https://www.topcoder.com/community/data-science/data-science-tutorials/line-sweep-algorithms/ and http://www.geeksforgeeks.org/given-a-set-of-line-segments-find-if-any-two-segments-intersect/
The text was updated successfully, but these errors were encountered: