Fitting rectilinear polygonal curves to a set of points in the plane

被引：33

作者：

Díaz-Báñez, JM ^{[1
]}

Mesa, JA

机构：

[1] Univ Sevilla, Dept Matemat Aplicada 2, EU Politecn, Seville, Spain

[2] Univ Sevilla, Dept Matemat Aplicada 2, ES Ingn, Seville, Spain

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2001年 / 130卷 / 01期

关键词：

optimization; polygonal approximation; facility location; computational geometry;

D O I：

10.1016/S0377-2217(00)00023-0

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper two problems of fitting rectilinear polygonal curves to a set of points in the plane according to the minimax approximation are considered. The constraints are, respectively, on the number of vertices and length of the polygonal curve. In both cases efficient algorithms are developed. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：214 / 222

页数：9