✦ LIBER ✦

Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon

✍ Scribed by A. García, P. Jodrá, J. Tejel

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

Finding an approximate minimum-link visi

✍ Muhammad H Alsuwaiyel; D.T Lee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 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

THE MINIMUM AREA OF A SIMPLE POLYGON WIT

✍ K. Böröczky; G. Kertész; E. Makai 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 756 KB

An Algorithm for Computing a Convex and

✍ J. -D. Boissonnat, S. K. Ghosh, T. Kavitha and S. Lazard 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 288 KB