Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given an even number of points in a plane,  are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For points in convex position,  present a quadratic-time algorithm for finding a bottleneck non-crossing matching, improving upon the best previously known algorithm of cubic time complexity.
['Marko Savić', 'Miloš Stojaković']
I am writing a research paper on a idea Faster Bottleneck Non-crossing Matchings of Points in Convex Position
[{"from": "human", "value": "I am writing a research paper on a idea Faster Bottleneck Non-crossing Matchings of Points in Convex Position"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given an even number of points in a plane,  are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For points in convex position,  present a quadratic-time algorithm for finding a bottleneck non-crossing matching, improving upon the best previously known algorithm of cubic time complexity."}]