Abstract
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 its distance from it to the k points. We present an O ( ( n × k ) log n ) time algorithm for this problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
