姑姑在炫耀 发表于 2025-3-26 23:02:25

Euclidean Shortest PathsThe introductory chapter explains the difference between shortest paths in finite graphs and shortest paths in Euclidean geometry, which is also called ‘the common geometry of our world’. The chapter demonstrates the diversity of such problems, defined between points in a plane, on a surface, or in the 3-dimensional space.

旧式步枪 发表于 2025-3-27 05:01:54

Deltas and EpsilonsThe introduction ended with recalling concepts in discrete mathematics as used in this book. This second chapter adds further basic concepts in continuous mathematics that are also relevant for this book, especially in the context of approximate algorithms.

MUTED 发表于 2025-3-27 09:14:20

http://reply.papertrans.cn/32/3165/316426/316426_33.png

peak-flow 发表于 2025-3-27 11:22:45

http://reply.papertrans.cn/32/3165/316426/316426_34.png

harrow 发表于 2025-3-27 17:36:44

978-1-4471-6064-9Springer-Verlag London Limited 2011

ILEUM 发表于 2025-3-27 20:13:25

Fajie Li,Reinhard KletteReviews 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 o

孤僻 发表于 2025-3-28 01:52:14

http://reply.papertrans.cn/32/3165/316426/316426_37.png

nepotism 发表于 2025-3-28 05:39:34

-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.978-1-4471-6064-9978-1-4471-2256-2

颠簸下上 发表于 2025-3-28 08:40:57

Andrea Bravo-Doddoli,Rozzana Sánchez-Aragón be) NP-complete or NP-hard 3D ESP problems in time ., where . is the number of layers in a stack, which is introduced in this chapter as being the .. The proposed approximation method has straightforward applications for ESP problems when analysing polyhedral objects (e.g., in 3D imaging), of for ‘

不确定 发表于 2025-3-28 10:48:40

Paths in Simple Polyhedrons be) NP-complete or NP-hard 3D ESP problems in time ., where . is the number of layers in a stack, which is introduced in this chapter as being the .. The proposed approximation method has straightforward applications for ESP problems when analysing polyhedral objects (e.g., in 3D imaging), of for ‘
页: 1 2 3 [4] 5 6
查看完整版本: Titlebook: Euclidean Shortest Paths; Exact or Approximate Fajie Li,Reinhard Klette Book 2011 Springer-Verlag London Limited 2011 Art Gallery Problems.