Abstract
Let R and B be two point sets in the plane with |R|=|B|=n. Let M={(ri,bi),i=1,2,…,n} be a perfect matching that matches points of R with points of B and maximizes ∑i=1n‖ri−bi‖, the total Euclidean distance of the matched pairs. In this paper, we prove that there exists a point o of the plane (the center of M) such that ‖ri−o‖+‖bi−o‖≤2‖ri−bi‖ for all i∈{1,2,…,n}.
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.
