Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of tracking the distance beten two convex polyhedra is finding applications in many areas of robotics. The algorithm of Lin and Canny (1991) is a ll-known fast solution to this problem, but by recasting the algorithms into configuration space,  show that a minor modification to the earlier algorithm of Gilbert, Johnson, and Keerthi (1988) also gives this algorithm the same expected cost.
['Stephen Cameron']
I am writing a research paper on a idea A comparison of two fast algorithms for computing the distance between convex polyhedra
[{"from": "human", "value": "I am writing a research paper on a idea A comparison of two fast algorithms for computing the distance between convex polyhedra"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of tracking the distance beten two convex polyhedra is finding applications in many areas of robotics. The algorithm of Lin and Canny (1991) is a ll-known fast solution to this problem, but by recasting the algorithms into configuration space,  show that a minor modification to the earlier algorithm of Gilbert, Johnson, and Keerthi (1988) also gives this algorithm the same expected cost."}]