✦ LIBER ✦

Time and space efficient algorithms for shortest paths between convex polygons

✍ Scribed by Hans Rohnert

Book ID: 113163162
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 396 KB
Volume: 27
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90022-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient time and space K point-to-p

An efficient time and space K point-to-point shortest simple paths algorithm

✍ Antonio Sedeño-Noda 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 720 KB

An Efficient Algorithm for Euclidean Sho

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane

✍ S. Kapoor; S. N. Maheshwari; J. S. B. Mitchell 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 126 KB

A linear time algorithm for the Hausdorf

A linear time algorithm for the Hausdorff distance between convex polygons

✍ Mikhail J. Atallah 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Time-space efficient algorithms for comp

Time-space efficient algorithms for computing convolutions and related problems

✍ David A. Carlson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 814 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w

A new algorithm for contact detection be

A new algorithm for contact detection between convex polygonal and polyhedral particles in the discrete element method

✍ C.W. Boon; G.T. Houlsby; S. Utili 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 989 KB