Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Search Syntax
s:d sort by date
r:uk uk region
site: domain search
\ search first result
More...
r:n turn off region
!a search search amazon
site:uk .uk pages
f: find files
t: within title
b: within body
More explanation...
Euclidean shortest path
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.
More at Wikipedia
Shortest path problem
Geometric algorithms
Computational science
This page requires JavaScript. Get the non-JS version
here
.