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.