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

被引：0

作者：

Kels, Shay ^{[1
]}

Dyn, Nira ^{[1
]}

Lipovetsky, Evgeny ^{[2
]}

机构：

[1] Tel Aviv Univ, Sch Math Sci, Tel Aviv, Israel

[2] Parametr Tech Israel Ltd, PTC Corp, Herzliyya, Israel

来源：

ALGORITHMS | 2010年 / 3卷 / 03期

关键词：

metric average; computational geometry; computational complexity; Voronoi diagrams; 2D arrangements;

D O I：

10.3390/a3030265

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The metric average is a binary operation between sets in R-n 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.

引用

页码：265 / 275

页数：11

共 15 条

[1] PIECEWISE LINEAR-APPROXIMATIONS OF SET-VALUED MAPS
ARTSTEIN, Z
[J]. JOURNAL OF APPROXIMATION THEORY, 1989, 56 (01) : 41 - 47
[2] Aurenhammer F, 2000, HANDBOOK OF COMPUTATIONAL GEOMETRY, P201, DOI 10.1016/B978-044482537-7/50006-1
[3] Baier R., 2002, APPROXIMATION THEORY, VX, P9
[4] de Berg M., 2008, COMPUTATIONAL GEOMET, V3rd
[5] Set-valued approximations with Minkowski averages - Convergence and convexification rates
Dyn, N
Farkhi, E
[J]. NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2004, 25 (3-4) : 363 - 377
[6] Dyn N., 4 POINT SUBDIV UNPUB
[7] Dyn N., 2001, TRENDS APPROXIMATION, P95
[8] Fogel E., 2010, CGAL USER REFERENCE
[9] Frankel D., 2004, REABILITA O NEUROL G, P529
[10] Karavelas M., 2010, CGAL USER REFERENCE

← 1 2 →