Fréchet Edit Distance
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910373977784320 |
|---|---|
| author | Fox, Emily Nayyeri, Amir Perry, Jonathan James Raichel, Benjamin |
| author_facet | Fox, Emily Nayyeri, Amir Perry, Jonathan James Raichel, Benjamin |
| contents | We define and investigate the Fréchet edit distance problem. Given two polygonal curves $π$ and $σ$ and a threshhold value $δ>0$, we seek the minimum number of edits to $σ$ such that the Fréchet distance between the edited $σ$ and $π$ is at most $δ$. For the edit operations we consider three cases, namely, deletion of vertices, insertion of vertices, or both. For this basic problem we consider a number of variants. Specifically, we provide polynomial time algorithms for both discrete and continuous Fréchet edit distance variants, as well as hardness results for weak Fréchet edit distance variants. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_12878 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fréchet Edit Distance Fox, Emily Nayyeri, Amir Perry, Jonathan James Raichel, Benjamin Computational Geometry We define and investigate the Fréchet edit distance problem. Given two polygonal curves $π$ and $σ$ and a threshhold value $δ>0$, we seek the minimum number of edits to $σ$ such that the Fréchet distance between the edited $σ$ and $π$ is at most $δ$. For the edit operations we consider three cases, namely, deletion of vertices, insertion of vertices, or both. For this basic problem we consider a number of variants. Specifically, we provide polynomial time algorithms for both discrete and continuous Fréchet edit distance variants, as well as hardness results for weak Fréchet edit distance variants. |
| title | Fréchet Edit Distance |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2403.12878 |