Euclidean shortest paths exact or approximate algorithms /
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...
| Main Author: | Li, Fajie, |
|---|---|
| Other Authors: | Klette, Reinhard,, SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
London ; New York :
Springer,
[2011]
|
| Physical Description: |
1 online resource (xvii, 376 pages) : color illustrations. |
| Subjects: |
CMU Electronic Access
Electronic Resource Click Here| Location | Call Number: | Status |
|---|---|---|
| CMU Electronic Access | Available |