Algorithms 2010, 3(3), 265-275; doi:10.3390/a3030265
Article

Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries

Shay Kels 1,* email, Nira Dyn 1 email and Evgeny Lipovetsky 2 email
1 School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, Israel 2 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
(This article belongs to the Special Issue Algorithms for Applied Mathematics)
PDF Full-text Download PDF Full-Text [247 KB, Updated Version, uploaded 29 July 2010 09:31 CEST]
The original version is still available [248 KB, uploaded 26 July 2010 09:12 CEST]
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 Statistics

Click here to load and display the download statistics.

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.

AMA Style

Kels S, Dyn N, Lipovetsky E. Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries. Algorithms. 2010; 3(3):265-275.

Chicago/Turabian Style

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.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert