Let P be a simple rectilinear polygon with n vertices. There are k points in P. The maxian problem is to locate a single facility in P so as to maximize the sum of the distance from it to the k points. We present an O((n×k)logn) time algorithm for this problem.
