Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the ll-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance beten two closed polygonal curves with m and n vertices is less than a given number e. The algorithm takes O(mn) time whereas the previously known algorithms take O(mnlog(mn)) time.
['Michail I. Schlesinger', 'Evgeniy Vodolazskiy', 'V. M. Yakovenko']
I am writing a research paper on a idea Frechet similarity of closed polygonal curves
[{"from": "human", "value": "I am writing a research paper on a idea Frechet similarity of closed polygonal curves"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the ll-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance beten two closed polygonal curves with m and n vertices is less than a given number e. The algorithm takes O(mn) time whereas the previously known algorithms take O(mnlog(mn)) time."}]