Gradient algorithms for polygonal approximation of convex contours

The subjects of this paper are descent algorithms to optimally approximate a 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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Automatica (Oxford) Jg. 45; H. 2; S. 510 - 516
Hauptverfasser:	Susca, Sara, Bullo, Francesco, Martínez, Sonia
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Kidlington Elsevier Ltd 01.02.2009 Elsevier
Schlagworte:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Control theory. Systems Convex body approximation Exact sciences and technology Gradient methods Interpolation Motion coordination Polygonal approximation Robotics Software Gradient methods Interpolation Motion coordination Polygonal approximation Convex body approximation Coordination Data compression Feedback regulation Control synthesis Robotics Gradient descent Descent method Metric Sensor array Motion control Gradient method Convex polygon
ISSN:	0005-1098, 1873-2836
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!