Distributed algorithms for polygonal approximation of convex contours


Sara Susca, Sonia Martínez and Francesco Bullo
Proceedings of the 45th IEEE Int. Conf. on Decision and Control, San Diego, USA, December 2006

Abstract:

We propose algorithms that compute polygon approximations for convex contours. This geometric problem is relevant in interpolation theory, data compression, and has potential applications in robotic sensor networks. The algorithms are based on simple feedback ideas, on limited nearest-neighbor information, and amount to gradient descent laws for appropriate cost functions. The approximations are based on intuitive performance metrics, such as the area of the inner, outer, and "outer minus inner" approximating polygons.


File: main.pdf


Bib-tex entry:

@InProceedings{SS-SM-FB:06-cdc,
author = {S. Susca and S. Mart{\'\i}nez and F. Bullo},
booktitle = {45th IEEE International Conference on Decision and Control},
title = {Distributed algorithms for polygonal approximation of convex contours},
year = {2006},
address = {San Diego}
}