Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
London :
Springer London : Imprint: Springer,
2011.
|
| Edición: | 1st ed. 2011. |
| Temas: | |
| Acceso en línea: | Texto Completo |