Open AccessThis article is
- freely available
Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries
School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, Israel
PTC Corp, Parametric Tech. Israel Ltd., Herzliya, Israel
* Author to whom correspondence should be addressed.
Received: 5 May 2010; in revised form: 8 July 2010 / Accepted: 22 July 2010 / Published: 26 July 2010
Abstract: The metric average is a binary operation between sets in Rn which is used in the approximation of set-valued functions. We introduce an algorithm that applies tools of computational geometry to the computation of the metric average of 2D sets with piecewise linear boundaries.
Keywords: metric average; computational geometry; computational complexity; Voronoi diagrams; 2D arrangements
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Kels, S.; Dyn, N.; Lipovetsky, E. Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries. Algorithms 2010, 3, 265-275.
Kels S, Dyn N, Lipovetsky E. Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries. Algorithms. 2010; 3(3):265-275.
Kels, Shay; Dyn, Nira; Lipovetsky, Evgeny. 2010. "Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries." Algorithms 3, no. 3: 265-275.