Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Euclidean Shortest Paths

Euclidean Shortest Paths

Exact or Approximate Algorithms

Li, Fajie, Klette, Reinhard

2011, XVIII, 378 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$99.00

(net) price for USA

ISBN 978-1-4471-2256-2

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$129.00

(net) price for USA

ISBN 978-1-4471-2255-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$129.00

(net) price for USA

ISBN 978-1-4471-6064-9

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Reviews algorithms for the exact or approximate solution of Euclidean shortest-path problems, with a specific focus on rubberband algorithms
  • Provides theoretical and programming exercises at the end of each chapter
  • Discusses each concept and algorithm in depth, including mathematical proofs for many of the given statements

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

This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Suitable for a second- or third-year university algorithms course, the text enables readers to understand not only the algorithms and their pseudocodes, but also the correctness proofs, the analysis of time complexities, and other related topics.

Topics and features:

  • Provides theoretical and programming exercises at the end of each chapter
  • Presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms
  • Discusses algorithms for calculating exact or approximate ESPs in the plane
  • Examines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curves
  • Describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems
  • Includes lists of symbols and abbreviations, in addition to other appendices

This hands-on guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortest-path problems in practical applications will also find the book a useful resource.

Dr. Fajie Li is at Huaqiao University, Xiamen, Fujian, China. Prof. Dr. Reinhard Klette is at the Tamaki Innovation Campus of The University of Auckland.

Content Level » Research

Keywords » Art Gallery Problems - Computational Geometry - Cube Curves - Euclidean Shortest Path - Parts Cutting Problem - Rubberband Algorithm - Safari Problem - Simple Polygon - Surface of Polytope - Touring Polygons - Watchman Route Problem - Zookeeper Problem - q-Rectangles

Related subjects » Image Processing - Information Systems and Applications - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.

Additional information