Polygonal approximation using integer particle swarm optimization
From MaRDI portal
Recommendations
- An efficient evolutionary algorithm for accurate polygonal approximation
- A new method for polygonal approximation using genetic algorithms
- Optimal polygonal approximation of digital planar curves using meta heuristics
- Ant colony search algorithms for optimal polygonal approximation of plane curves.
- scientific article; zbMATH DE number 4018212
Cites work
- A new method for polygonal approximation using genetic algorithms
- An efficient evolutionary algorithm for accurate polygonal approximation
- Ant colony search algorithms for optimal polygonal approximation of plane curves.
- Optimal polygonal approximation of digital planar curves using meta heuristics
- Optimized polygonal approximation by dominant point deletion
- Optimum polygonal approximation of digitized curves
- Polygonal approximation of closed discrete curves
- Polygonal approximation of digital planar curves through break point suppression
- Polygonal approximation of digital planar curves through vertex betweenness
Cited in
(5)- Ant colony search algorithms for optimal polygonal approximation of plane curves.
- Dominant point detection based on discrete curve structure and applications
- Snake curve extraction algorithm based on improved particle swarm optimization
- Particle swarm optimization for road extraction in SAR images
- An efficient evolutionary algorithm for accurate polygonal approximation
This page was built for publication: Polygonal approximation using integer particle swarm optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506726)