Optimal polygonal approximation of digital planar curves using meta heuristics

DOI10.1016/S0031-3203(00)00097-2zbMath0985.68736OpenAlexW1970661014MaRDI QIDQ5943305

Hong Bin Zhang, Jianjun Guo

Publication date: 9 September 2001

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(00)00097-2

zbMATH Keywords

heuristic algorithmsoptimal polygonal approximation of digital planar curves

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (4)

Polygonal approximation of closed discrete curves ⋮ A discrete geometry approach for dominant point detection ⋮ Polygonal approximation using integer particle swarm optimization ⋮ Data reduction of large vector graphics

Uses Software

• Tabu search

Cites Work

• Optimum polygonal approximation of digitized curves
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal polygonal approximation of digital planar curves using meta heuristics