✦ LIBER ✦

A linear time algorithm for finding all farthest neighbors in a convex polygon

✍ Scribed by Alok Aggarwal; Dina Kravets

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear algorithm for finding the conve

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

Finding the convex hull of a simple poly

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

A linear-time algorithm for computing th

✍ Alok Aggarwal; Leonidas J. Guibas; James Saxe; Peter W. Shor 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 906 KB

A linear time algorithm for obtaining th

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

A linear time algorithm for max-min leng

✍ Shiyan Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A linear-time algorithm for finding all

✍ Michael R. Garey; Robert E. Tarjan 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 468 KB