אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב
יום ראשון, 03.06.2012, 13:00
חדר 337, בניין טאוב למדעי המחשב
Although many algorithms for computing Euclidean Voronoi diagrams of point sites have been published, most of them are sequential in nature and hence cast inherent difficulties on the possibility to compute the diagrams in parallel. We present a new algorithm which enables the (combinatorial) computation of each of the Voronoi cells independently of the other ones. The algorithm is significantly different from previous ones and some of the ideas related to it are in the spirit of convex analysis.
A new combinatorial structure for representing the cells is described along the way, and the computation of the corresponding Delaunay graph follows as a simple consequence.
An implementation of the algorithm (done by Omri Azencot) will be presented.