✦ LIBER ✦

Finding the Shortest Watchman Route in a Simple Polygon

✍ Scribed by S. Carlsson; H. Jonsson; B. J. Nilsson

Book ID: 105746683
Publisher: Springer
Year: 1999
Tongue: English
Weight: 352 KB
Volume: 22
Category: Article
ISSN: 0179-5376
DOI: 10.1007/pl00009467

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Finding a shortest diagonal of a simple

Finding a shortest diagonal of a simple polygon in linear time

✍ John Hershberger; Subhash Suri 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Finding the convex hull of a simple poly

Finding the convex hull of a simple polygon

✍ Ronald L Graham; F Frances Yao 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Finding the convex hull of a simple poly

Finding the convex hull of a simple polygon

✍ Jack Sklansky 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 304 KB

On finding the convex hull of a simple p

On finding the convex hull of a simple polygon

✍ D. T. Lee 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 478 KB