Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduces the concept of minimum bundling distance (MBD) of a set of line segments.  prove it can be calculated by computing the minimum distance beten two convex polygon chains made of a set of line segments in a plane.  first propose an incremental method to compute the two convex polygon chains, and then give an improved algorithm of calculating minimum distance beten them. The time complexity of the whole algorithm is O(nlogn).
['Xiaoting Wang', 'Chenglei Yang']
I am writing a research paper on a idea Computing Minimum Bundling Distance of a Set of Line Segments
[{"from": "human", "value": "I am writing a research paper on a idea Computing Minimum Bundling Distance of a Set of Line Segments"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduces the concept of minimum bundling distance (MBD) of a set of line segments.  prove it can be calculated by computing the minimum distance beten two convex polygon chains made of a set of line segments in a plane.  first propose an incremental method to compute the two convex polygon chains, and then give an improved algorithm of calculating minimum distance beten them. The time complexity of the whole algorithm is O(nlogn)."}]