Abstract

Given a set of n weighted points in the plane, a set of non-negative (ordered) weights and a connected polygonal region S, the weighted anti-ordered median straight-line location problem consists in finding a straight line intersecting S and maximizing the sum of ordered weighted distances to the points. In this paper we show how to find such a straight line in O(n4) time when the Euclidean distance is considered. As a consequence of the results given in the paper the weighted Euclidean anti-median straight-line problem can be solved in O(n2) time.

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 call

Disclaimer: 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.