Given a list of simple obstacle polygons, build the visibility graph and find the shortest path between two points
-
Updated
Dec 18, 2020 - Python
Given a list of simple obstacle polygons, build the visibility graph and find the shortest path between two points
python package for fast shortest path computation on 2D polygon or grid maps
Input a list of simple obstacle polygons, build the visibility graph and find the shortest path between two points.
Meine Lösungen für die 2. Runde des 37. Bundeswettbewerbs Informatik
Perform a visibility graph analysis quickly and easily. Visibility calculation done in C.
Add a description, image, and links to the visibility-graph-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the visibility-graph-algorithm topic, visit your repo's landing page and select "manage topics."