Approximation of Point Sets by 1-Corner Polygonal Chains
José Miguel Díaz-Báñez, Francisco Gómez, Ferrán Hurtado · INFORMS journal on computing · 2000
In this paper we consider some problems that belong to the interplay between the field of Facility Location and the area of Computational Geometry. Specifically, given a set S of points in the plane, we discuss several variations of the problem of finding monotone 1-corner polygonal chains that minimize the maximum vertical distance to S.