Euclidean shortest path
id:
euclidean-shortest-path-199-4918358
title:
Euclidean shortest path
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Problem of computing shortest paths around geometric obstacles
original url:
https://en.wikipedia.org/wiki/Euclidean_shortest_path
date created:
date modified:
2024-03-11T06:30:30Z
main entity:
{"identifier":"Q5406126","url":"https://www.wikidata.org/entity/Q5406126"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/en/0/0d/Euclidean_Shortest_Path_KernelCAD_Screenshot.jpg","width":226,"height":101}
fields total:
13
integrity:
15