Euclidean Shortest Paths

欧几里德最短路径:精确或近似的算法

计算数学

原   价:
1767.5
售   价:
1414.00
优惠
平台大促 低至8折优惠
作      者
出  版 社
出版时间
2011年11月15日
装      帧
精装
ISBN
9781447122555
复制
页      码
396
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 69 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个