In this paper we consider some problems that belong to the interplay betwee
n the field of Facility Location and the area of Computational Geometry. Sp
ecifically, given a set S of points in the plane, we discuss several variat
ions of the problem of finding monotone 1-corner polygonal chains that mini
mize the maximum vertical distance to S.