A new method for polygonal approximation using genetic algorithms
From MaRDI portal
Publication:4226580
DOI10.1016/S0167-8655(98)00082-8zbMATH Open0915.68174MaRDI QIDQ4226580FDOQ4226580
Authors: Peng-Yeng Yin 
Publication date: 28 June 1999
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Recommendations
- An efficient evolutionary algorithm for accurate polygonal approximation
- Optimal polygonal approximation of digital planar curves using meta heuristics
- Polygonal approximation using integer particle swarm optimization
- A Hybrid Genetic Algorithm for Two Types of Polygonal Approximation Problems
- A split/merge method with ranking selection for polygonal approximation of digital curve
Learning and adaptive systems in artificial intelligence (68T05) Searching and sorting (68P10) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)
Cited In (12)
- Recognition of digital curves scanned from paper drawings using genetic algorithms
- A Hybrid Genetic Algorithm for Two Types of Polygonal Approximation Problems
- Wavelet-Based Signal Approximation with Genetic Algorithms
- Digital straightness, circularity, and their applications to image analysis
- On genetic algorithms for the packing of polygons
- Data reduction of large vector graphics
- A split/merge method with ranking selection for polygonal approximation of digital curve
- Trigonometric Curve Fitting Based on Genetic Algorithm and the Application of Data Processing in Geography
- Polygonal approximation using integer particle swarm optimization
- Outline capturing using rational functions with the help of genetic algorithm
- An efficient evolutionary algorithm for accurate polygonal approximation
- Polygonal approximation of closed discrete curves
This page was built for publication: A new method for polygonal approximation using genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226580)
