𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A discrete particle swarm algorithm for optimal polygonal approximation of digital curves

✍ Scribed by Peng-Yeng Yin

Book ID
108197288
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
421 KB
Volume
15
Category
Article
ISSN
1047-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ant colony search algorithms for optimal
Ant colony search algorithms for optimal polygonal approximation of plane curves
✍ Peng-Yeng Yin πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 390 KB

This paper presents a new polygonal approximation method using ant colony search algorithm. The problem is represented by a directed graph such that the objective of the original problem becomes to ΓΏnd the shortest closed circuit on the graph under the problem-speciΓΏc constraints. A number of artiΓΏc