✦ LIBER ✦

Efficient Algorithms for Approximating Polygonal Chains

✍ Scribed by P. K. Agarwal; K. R. Varadarajan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient evolutionary algorithm for

✍ Shinn-Ying Ho; Yeong-Chinq Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 276 KB

An O(N) algorithm for polygonal approxim

✍ L.P Cordella; G Dettori 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Efficient MFS algorithms in regular poly

✍ Andreas Karageorghis 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 533 KB

A simple algorithm for detection of sign

✍ Debranjan Sarkar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 301 KB

An algorithm for polygonal approximation

✍ Bimal Kr. Ray; Kumar S. Ray 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 602 KB

CIM algorithm for approximating three-di

✍ Junhai Yong; Shimin Hu; Jiaguang Sun 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 591 KB