Exploring the Performance of Genetic Algorithms as Polygonal Approximators

  • Authors:
  • Affiliations:
  • Venue:
  • ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The construction of polygonal approximations for digital curves is a well-known technique to obtain a compact representation of them. Over the last years, a number of methods have been proposed to optimize this process, based on different criteria. In this paper, polygonal approximation making is viewed as an optimization problem, and the use of a genetic algorithm is proposed as a method to find a solution that best meets a given set of requirements. This paper analyses the capability and the performance of the genetic algorithm to select the vertices of the polygons, and some advantages and drawbacks are discussed.