✦ LIBER ✦

Shortest paths in simple polygons with polygon-meet constraints

✍ Scribed by Ramtin Khosravi; Mohammad Ghodsi

Book ID: 108153365
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 204 KB
Volume: 91
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2004.04.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest polygonal paths in space

✍ R. E. Burkard; G. Rote; E. Y. Yao; Z. L. Yu 📂 Article 📅 1990 🏛 Springer Vienna 🌐 English ⚖ 818 KB

Query-point visibility constrained short

Query-point visibility constrained shortest paths in simple polygons

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

Finding a shortest Hamiltonian path insi

Finding a shortest Hamiltonian path inside a simple polygon

✍ Muhammad H. Alsuwaiyel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Polygonal path simplification with angle

Polygonal path simplification with angle constraints

✍ Danny Z. Chen; Ovidiu Daescu; John Hershberger; Peter M. Kogge; Ningfang Mi; Jac 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Finding shortest safari routes in simple

Finding shortest safari routes in simple polygons

✍ Xuehou Tan; Tomio Hirata 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let P be a simple polygon, and let P be a set of disjoint convex polygons inside P , each sharing one edge with P . The safari route problem asks for a shortest route inside P that visits each polygon in P. In this paper, we first present a dynamic programming algorithm with running time O(n 3 ) for

Parallel algorithms for shortest path pr

Parallel algorithms for shortest path problems in polygons

✍ Hossam ElGindy; Michael Goodrich 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 665 KB