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 |