In this thesis, the problem of computing the $L_1$-center of a simple polygon is considered.
Given a simple polygon P with n vertices, the $L_1$-center of P is the set of points x inside P at which the maximum rectilinear internal distance from x to any other points in P si minimized. We present an O (n long n) time and O(n) space algorithm for this problem.