Euclidean shortest path

From Wikipedia, the free encyclopedia

This problem is studied in computational geometry: given a set of polyhedral obstacles in a Euclidean space, having a total of n vertices; design algorithms for efficient (exact or approximate) calculation of a shortest, obstacle-avoiding path connecting any two query points.

[edit] External links

[edit] Software

• VisiLibity: A free open source C++ library of floating-point visibility algorithms and supporting data types. This software uses the visibility graph method for calculating Euclidean shortest paths through polygonal environments with polygonal holes. A Matlab interface is also included.