Euclidean Shortest Paths: Exact or Approximate Algorithms
Author:   Fajie Li ,  Reinhard Klette
Publisher:   Springer London Ltd
Edition:   2011
ISBN:  

9781447122555


Pages:   378
Publication Date:   04 November 2011
Format:   Hardback
Availability:   Awaiting stock   Availability explained
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Our Price $340.56 Quantity:  
Add to Cart

Share |

Euclidean Shortest Paths: Exact or Approximate Algorithms


Add your own review!

Overview

Full Product Details

Author:   Fajie Li ,  Reinhard Klette
Publisher:   Springer London Ltd
Imprint:   Springer London Ltd
Edition:   2011
Dimensions:   Width: 15.50cm , Height: 2.20cm , Length: 23.50cm
Weight:   0.758kg
ISBN:  

9781447122555


ISBN 10:   1447122550
Pages:   378
Publication Date:   04 November 2011
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Awaiting stock   Availability explained
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Table of Contents

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.

Reviews

From the reviews: Li (Huaqiao Univ., China) and Klette (Univ. of Auckland, New Zealand) have written an interesting and very reader-friendly book on algorithms that find a shortest path between two vertices of a graph. ... this is the first book-length treatment of the topic. The entire text is accessible to advanced undergraduates. ... Summing Up: Highly recommended. Upper-division undergraduates, graduate students, and researchers/faculty. (M. Bona, Choice, Vol. 49 (9), May, 2012)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now