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...
| 主要作者: | |
|---|---|
| 企業作者: | |
| 其他作者: | |
| 格式: | Electronic Resource |
| 語言: | English |
| 出版: |
London
Springer
2011.
|
| 主題: | |
| 在線閱讀: | Available for University of the Philippines Diliman via SpringerLink. Click here to access |