Analisi e valutazione di algoritmi distribuiti per la costruzione della Triangolazione di Delaunay

Delaunay triangulations are very useful because of their mathematical properties, expolited in several distributed applications, from peer-to-peer networks to sensor and geographical networks. For these reasons, several distributed algorithms for the construction of Delaunay based overlays have been recently proposed. This thesis presents a survey of the main distributed algorithms for the construction of the Delaunay Triangulation presented in the last years, and of their applications, with particular focus on the innovative techniques. The analysis has led to the definition of NewACE, a new distributed algorithm, which has been compared with two state of art approahes. The thesis presents a set of experimental results showing the pro and the cons of these algorithms