Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00218122n
Noun Concept
JA
No term available
EN
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. Wikipedia
Relations
Sources
NAMED AFTER
エウクレイデス

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License