𝔖 Bobbio Scriptorium
✦   LIBER   ✦

CIM algorithm for approximating three-dimensional polygonal curves

✍ Scribed by Junhai Yong; Shimin Hu; Jiaguang Sun

Publisher
Springer
Year
2001
Tongue
English
Weight
591 KB
Volume
16
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximating Polygonal Curves in Two an
Approximating Polygonal Curves in Two and Three Dimensions
✍ Kento Miyaoku; Koichi Harada πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 134 KB

We discuss the weighted minimum number polygonal approximation problem. Eu and Toussaint (1994, CVGIP: Graphical Models Image Process. 56, 231-246) considered this problem subject to the parallel-strip error criterion in R 2 with L q distance metrics, and they concluded that it can be solved in O(n

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