pith. sign in

arxiv: 1505.04093 · v1 · pith:SDTT7F6Onew · submitted 2015-05-15 · 💻 cs.CG

Frechet similarity of closed polygonal curves

classification 💻 cs.CG
keywords closedcurvesfrechetpolygonalalgorithmmetricsimilaritytime
0
0 comments X
read the original abstract

The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.