Please subscribe to the official Codeforces channel in Telegram via the link ×

Euclidean plane red/blue points matching problem

Revision en1, by farnasirim, 2016-02-29 18:46:23

Hey there. Thanks for the time you're putting on reading this. I would appreciate it if you could kindly help me to solve this problem.

There are N blue points and N red points on the euclidean plane. We are to match every blue point with exactly one red point with a line segment such that no two line segments intersect.

Thank you in advance.

Tags divide and conquer, geometry


  Rev. Lang. By When Δ Comment
en1 English farnasirim 2016-02-29 18:46:23 398 Initial revision (published)