Robot Motion Planning and Visibility Graphs
Abstract
A brief description of the problem
Some definitions
An algorithm for finding the path of a point robot
Minkowski Sum
Visibility Graphs
An
O
(
n
2
log
n
) Algorithm for Computing Visibility Graphs
Dijkstra's algorithm for computing shortest paths
Conclusion
Bibliographic search
Implementation of "Naive" algorithms in Java