An algorithm for finding the shortest sailing distance from any maritime navigable point to a designated port

DOI10.1016/S0895-7177(04)90545-6zbMATH Open1055.90512MaRDI QIDQ1767073

E. R. Beeker

Publication date: 4 March 2005

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

Shortest pathDelaunay triangulation on a sphereDeploymentStrategic sealift

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Shortest paths in the plane with polygonal obstacles

This page was built for publication: An algorithm for finding the shortest sailing distance from any maritime navigable point to a designated port

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767073)