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.
Euclidean space | Euclidean vector | List of United Kingdom MPs with the shortest service | Euclidean geometry | Thames Path | Star Wars: Darth Bane: Path of Destruction | Path integral formulation | path integral formulation | non-Euclidean geometry | flare path | Sussex Border Path | Path to the Draft | Honea Path, South Carolina | Halima's Path | Euclidean group | Euclidean distance | Euclidean | Elastic Path | World Trade Center (PATH station) | Warriors Path State Park | The Path of Totality Tour | ''The Path of Totality'' Tour | The Path of Totality | The Faerie Path | The Cinder Path | The Aryan Path | Shortest path problem | path integral | Offa's Dyke Path | Newport (PATH station) |
Therefore, the Euclidean shortest path problem may be decomposed into two simpler subproblems: constructing the visibility graph, and applying a shortest path algorithm such as Dijkstra's algorithm to the graph.