✦ LIBER ✦

An efficient evolutionary algorithm for accurate polygonal approximation

✍ Scribed by Shinn-Ying Ho; Yeong-Chinq Chen

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 276 KB
Volume: 34
Category: Article
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(00)00159-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for Approximating P

Efficient Algorithms for Approximating Polygonal Chains

✍ P. K. Agarwal; K. R. Varadarajan 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 178 KB

An O(N) algorithm for polygonal approxim

An O(N) algorithm for polygonal approximation

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

An algorithm for polygonal approximation

An algorithm for polygonal approximation of digitized curves

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

An algorithm for polygonal approximation

An algorithm for polygonal approximation of a digital object

✍ Abolfazl Sirjani; George R Cross 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Mesh optimization for surface approximat

Mesh optimization for surface approximation using an efficient coarse-to-fine evolutionary algorithm

✍ Hui-Ling Huang; Shinn-Ying Ho 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 901 KB

The investigated mesh optimization problem C(N; n) for surface approximation, which is NP-hard, is to minimize the global error between a digital surface and its approximating mesh surface by e ciently locating a limited number n of grid points which are a subset of the original N sample points. Thi

An algorithm for polygonal approximation

An algorithm for polygonal approximation based on iterative point elimination

✍ Arie Pikaz; Its'hak Dinstein 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 626 KB