Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let P and Q be disjoint polygons in the plane.  consider the problem of finding an optimal bridge (p,q) , p∈ \partial P and q∈ \partial Q , such that the length of the longest path from a point in P , passing through the bridge (p,q) , to a point Q is minimized.  propose efficient algorithms for three cases according to whether P and Q are convex or not. These problems are motivated from the bridge construction beten two islands (or the canal construction beten two lakes).
['Sung Kwon Kim', 'Chan-Su Shin']
I am writing a research paper on a idea Computing the Optimal Bridge between Two Polygons
[{"from": "human", "value": "I am writing a research paper on a idea Computing the Optimal Bridge between Two Polygons"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let P and Q be disjoint polygons in the plane.  consider the problem of finding an optimal bridge (p,q) , p\u2208 \\partial P and q\u2208 \\partial Q , such that the length of the longest path from a point in P , passing through the bridge (p,q) , to a point Q is minimized.  propose efficient algorithms for three cases according to whether P and Q are convex or not. These problems are motivated from the bridge construction beten two islands (or the canal construction beten two lakes)."}]