Gradient algorithms for polygonal approximation of convex contours

Sara Susca, Francesco Bullo and Sonia Martínez
Automatica, 45 (1) (2009) 510-516

Abstract:

The subject of this paper are descent algorithms to optimally approximate a given strictly convex contour with a polygon. This classic geometric problem is relevant in interpolation theory and data compression, and has potential applications in robotic sensor networks. We design gradient descent laws for intuitive performance metrics such as the area of the inner, outer, and ``outer minus inner'' approximating polygons. The algorithms position the polygon vertices based on simple feedback ideas and on limited nearest-neighbor interaction.

File: main.pdf

Bib-tex entry:

@article{SS-SM-FB:08b,
author = {S. Susca and S. Mart{\'\i}nez and F. Bullo},
title = {Gradient algorithms for polygonal approximation of convex contours},
journal= {Automatica},
volume = {45},
number = {1},
pages = {510--516},
year = {2009}
}