✦ LIBER ✦

An algorithm for determining an opaque minimal forest of a convex polygon

✍ Scribed by Varol Akman

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n3) algorithm for finding the minim

✍ Pratul Dublish 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 131 KB

A counterexample to the algorithms for d

✍ Thomas Shermer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 117 KB

An optimal algorithm for roundness deter

✍ Kurt Swanson; D.T. Lee; Vanban L. Wu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 519 KB

An algorithm for determining the minimal

✍ J.B. Hughes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 467 KB

An algorithm for determining all extreme

✍ M. E. Dyer; L. G. Proll 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 794 KB

A linear time algorithm for computing th

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