✦ LIBER ✦

An O(n3) algorithm for finding the minimal opaque forest of a convex polygon

✍ Scribed by Pratul Dublish

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for determining an opaque m

✍ Varol Akman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 420 KB

An O(n) algorithm to find a near-optimum

✍ T.C Hu; M.T Shing 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 673 KB

A linear algorithm for finding the conve

✍ Duncan McCallum; David Avis 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A new O(n·log n) algorithm for computing

✍ Sukhamay Kundu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 441 KB

An algorithm for finding the Chebyshev c

✍ N. D. Botkin; V. L. Turova-Botkina 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 498 KB

A linear time algorithm for computing th

✍ S.K. Ghosh; R.K. Shyamasundar 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 524 KB