Euclidean shortest paths : exact or approximate algorithms

著者

• Li, Fajie
• Klette, Reinhard

書誌事項

Euclidean shortest paths : exact or approximate algorithms

Fajie Li, Reinhard Klette

Springer-Verlag, c2011

注記

Includes bibliographic references and index

内容説明・目次

内容説明

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

目次

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

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BB09119819
• ISBN:
  • 9781447122555
• LCCN: 2011941219
• 出版国コード: uk
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: London ; New York
• ページ数/冊数: xvii, 376 p.
• 大きさ: 24 cm
• 分類:
  • LCC : QA166.245
  • DC23 : 511.5
• 件名:
  • LCSH : Graph algorithms