This repository is not active
Dejko95/Robot-path-planning
Algorithm for finding the shortest path between two points among obstacles. It uses Lee's method that finds a visibility graph first, and then perform Dijkstra's algorithm on it. Total complexity is O(n^2 log n).
Java