✦ LIBER ✦

A linear time algorithm for computing the convex hull of an ordered crossing polygon

✍ Scribed by S.K. Ghosh; R.K. Shyamasundar

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 computing th

✍ Alok Aggarwal; Leonidas J. Guibas; James Saxe; Peter W. Shor 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 906 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 max-min leng

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

A counterexample to an algorithm for com

✍ Godfried T. Toussaint; Hossam El Gindy 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 241 KB

An optimal algorithm for computing the m

✍ G. T. Toussaint 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 374 KB