✦ LIBER ✦

Finding a shortest Hamiltonian path inside a simple polygon

✍ Scribed by Muhammad H. Alsuwaiyel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding an approximate minimum-link visi

✍ Muhammad H Alsuwaiyel; D.T Lee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Finding a shortest diagonal of a simple

✍ John Hershberger; Subhash Suri 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 792 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

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

Finding the convex hull of a simple poly

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