Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set of n red points and n blue points in the plane,  are interested to match the red points with the blue points by straight line segments in such a way that the segments do not cross each other and the length of the longest segment is minimized. In general, this problem in NP-hard.  give exact solutions for some special cases of the input point set.
['Ahmad Biniaz', 'Anil Maheshwari', 'Michiel H. M. Smid']
I am writing a research paper on a idea Bottleneck Bichromatic Plane Matching of Points
[{"from": "human", "value": "I am writing a research paper on a idea Bottleneck Bichromatic Plane Matching of Points"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set of n red points and n blue points in the plane,  are interested to match the red points with the blue points by straight line segments in such a way that the segments do not cross each other and the length of the longest segment is minimized. In general, this problem in NP-hard.  give exact solutions for some special cases of the input point set."}]