| Article ID: | iaor20013777 |
| Country: | Netherlands |
| Volume: | 130 |
| Issue: | 1 |
| Start Page Number: | 214 |
| End Page Number: | 222 |
| Publication Date: | Apr 2001 |
| Journal: | European Journal of Operational Research |
| Authors: | Mesa Juan A., Daz-Bez J.M. |
| Keywords: | geometry |
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.