✦ LIBER ✦

Finding an approximate minimum-link visibility path inside a simple polygon

✍ Scribed by Muhammad H Alsuwaiyel; D.T Lee

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a shortest Hamiltonian path insi

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

A linear time algorithm for minimum link

✍ Subhash Suri 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 93 KB

A linear time algorithm for minimum link

✍ Subhash Suri 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 827 KB