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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Li, Fajie (Autor), Klette, Reinhard (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Springer London : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Temas:
Algorithms.
Numerical analysis.
Pattern recognition systems.
Computer science-Mathematics.
Discrete mathematics.
Computer-aided engineering.
Numerical Analysis.
Automated Pattern Recognition.
Discrete Mathematics in Computer Science.
Mathematical Applications in Computer Science.
Computer-Aided Engineering (CAD, CAE) and Design.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Part I: Discrete or Continuous Shortest Paths
  • Euclidean Shortest Paths
  • Deltas and Epsilons
  • Rubberband Algorithms
  • Part II: Paths in the Plane
  • Convex Hulls in the Plane
  • Partitioning a Polygon or the Plane
  • Approximate ESP Algorithms
  • Part III: Paths in Three-Dimensional Space
  • Paths on Surfaces
  • Paths in Simple Polyhedrons
  • Paths in Cube Curves
  • Part IV: Art Galleries
  • Touring Polygons
  • Watchman Route
  • Safari and Zookeeper Problems.

Ejemplares similares