Euclidean shortest path

Example of a shortest path in a three-dimensional Euclidean space

The Euclidean shortest path problem is a problem in computational geometry: given a set of polyhedral obstacles in a Euclidean space, and two points, find the shortest path between the points that does not intersect any of the obstacles.