Chapter 15 – Geometric Shortest Paths and Network Optimization
作者： Joseph S.B. Mitchell
DOI: 10.1016/B978-044482537-7/50016-4
关键词: Combinatorial optimization 、 Yen's algorithm 、 Computer science 、 Mathematical optimization 、 Shortest Path Faster Algorithm 、 Constrained Shortest Path First 、 K shortest path routing 、 Euclidean shortest path 、 Average path length 、 Floyd–Warshall algorithm
摘要:
sci-hub.se 参考文章(341)
Joseph O'ROURKE, Uniqueness of Orthogonal Connect-the-Dots Machine Intelligence and Pattern Recognition. ,vol. 6, pp. 97- 104 ,(1988) , 10.1016/B978-0-444-70467-2.50013-8
Joonsoo Choi, Chee Keng Yap, None, Monotonicity of rectilinear geodesics in d-space symposium on computational geometry. ,(1996)
Pravin M. Vaidya, A fast approximation for minimum spanning trees in k-dimensional space foundations of computer science. pp. 403- 407 ,(1984)
Joonsoo Choi, Geodesic problems in high dimensions New York University. ,(1996)
Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell, The Lawnmower Problem. canadian conference on computational geometry. pp. 461- 466 ,(1993)
Leila de Floriani, Paola Magillo, Enrico Puppo, Chapter 7 – Applications of Computational Geometry to Geographic Information Systems Handbook of Computational Geometry. pp. 333- 388 ,(2000) , 10.1016/B978-044482537-7/50008-5
Laxmi Gewali, Simeon C. Ntafos, Watchman routes in the presence of a pair of convex polygons. canadian conference on computational geometry. pp. 127- 132 ,(1995)
Jean-Claude Latombe, Robot Motion Planning ,(1990)
P. Pradeep Kumar, C. E. Veni Madhavan, Shortest Watchman Tours in Weak Visibility Polygons. canadian conference on computational geometry. pp. 91- 96 ,(1993)
Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg -R. Sack, An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces scandinavian workshop on algorithm theory. pp. 11- 22 ,(1998) , 10.1007/BFB0054351