אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

In this talk we present an algorithm that applies segment Voronoi diagrams and planar arrangements to the computation of the metric average of two simple polygons. The algorithm is relevant to approximation of set-valued functions. We describe the implementation of the algorithm and present a collection of computational examples. Based on the computational framework of the algorithm, the connectedness of the metric average of two simple polygons is studied. Finally, we extend the algorithm to compute the metric average of two sets that are each a collection of simple polygons with simple polygonal holes.