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...
| Päätekijä: | |
|---|---|
| Yhteisötekijä: | |
| Muut tekijät: | |
| Aineistotyyppi: | Electronic Resource |
| Kieli: | English |
| Julkaistu: |
London
Springer
2011.
|
| Aiheet: | |
| Linkit: | Available for University of the Philippines Diliman via SpringerLink. Click here to access |