Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let G be an undirected plane graph with nonnegative edge length, and letk terminal pairs lie on two specified face boundaries.  presents an algorithm for findingk “noncrossing paths” inG, each connecting a terminal pair, and whose total length is minimum. Noncrossing paths may share common vertices or edges but do not cross each other in the plane. The algorithm runs in timeO(n logn) wheren is the number of vertices inG andk is an arbitrary integer.
['Junya Takahashi', 'Hitoshi Suzuki', 'Takao Nishizeki']
I am writing a research paper on a idea Shortest noncrossing paths in plane graphs
[{"from": "human", "value": "I am writing a research paper on a idea Shortest noncrossing paths in plane graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let G be an undirected plane graph with nonnegative edge length, and letk terminal pairs lie on two specified face boundaries.  presents an algorithm for findingk \u201cnoncrossing paths\u201d inG, each connecting a terminal pair, and whose total length is minimum. Noncrossing paths may share common vertices or edges but do not cross each other in the plane. The algorithm runs in timeO(n logn) wheren is the number of vertices inG andk is an arbitrary integer."}]