Euclidean Shortest Path

Euclidean Shortest Path

Edited by 

List price: US$38.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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. In two dimensions, the problem can be solved in polynomial time in a model of computation allowing addition and comparisons of real numbers, despite theoretical difficulties involving the numerical precision needed to perform such calculations. These algorithms are based on two different principles, either performing a shortest path algorithm such as Dijkstra's algorithm on a visibility graph derived from the obstacles or propagating a wavefront from one of the points until it meets the more

Product details

  • Paperback | 60 pages
  • 152 x 229 x 4mm | 100g
  • Secut Press
  • United States
  • English
  • black & white illustrations
  • 613627356X
  • 9786136273563