Geometrical Solutions for Some Minimax Location Problems

Four closely related minimax location problems are considered. Each involves locating a point in the plane to minimize the maximum distance (plus a possible constant) to a given finite set of points. The distance measures considered are the Euclidean and the rectilinear. In each case efficient, finite solution procedures are given. The arguments are geometrical.