✦ LIBER ✦

Shortest paths in the plane with convex polygonal obstacles

✍ Scribed by Hans Rohnert

Book ID: 113162870
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 435 KB
Volume: 23
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90045-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Curvature-Constrained Shortest Paths in

Curvature-Constrained Shortest Paths in a Convex Polygon

✍ Agarwal, Pankaj K.; Biedl, Therese; Lazard, Sylvain; Robbins, Steve; Suri, Subha 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 518 KB

Search for shortest path around semialge

Search for shortest path around semialgebraic obstacles in the plane

✍ T. Krick; A. O. Slisenko; P. Solerno; J. Heintz 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 483 KB

Shortest Path Queries Among Weighted Obs

Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

✍ Chen, Danny Z.; Klenk, Kevin S.; Tu, Hung-Yi T. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 447 KB

Shortest paths in simple polygons with p

Shortest paths in simple polygons with polygon-meet constraints

✍ Ramtin Khosravi; Mohammad Ghodsi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Covering the plane with convex polygons

✍ János Pach 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 568 KB