✦ LIBER ✦

Finding a shortest diagonal of a simple polygon in linear time

✍ Scribed by John Hershberger; Subhash Suri

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the shortest diagonal of a mon

✍ Binhai Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Finding a shortest Hamiltonian path insi

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

Finding the convex hull of a simple poly

✍ S.Y. Shin; T.C. Woo 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Finding the convex hull of a simple poly

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

Finding the convex hull of a simple poly

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

A linear time algorithm for minimum link

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