Euclidean Shortest Paths Exact or Approximate Algorithms

Euclidean Shortest Paths Exact or Approximate Algorithms / by Fajie Li, Reinhard Klette.

The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2- or 3-dimensional space? Variants of this industrially-significant computational geometry problem also require the path to pass through specified areas and avoid defined obsta...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Fajie (Author), Klette, Reinhard (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: London : Springer London : Imprint: Springer, 2011.
Edition:1st ed. 2011.
Series:Springer eBook Collection.
Subjects:
Algorithms.
Numerical analysis.
Pattern recognition.
Computer science—Mathematics.
Computer-aided engineering.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Login for hold information

‌

Click to view e-book

Online

Holdings details from Online
Call Number: E-Book
Status: Available

Similar Items