Approximately matching polygonal curves with respect to the Fréchet distance (Q705548): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.comgeo.2004.05.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COMGEO.2004.05.004 / rank | |||
Normal rank | |||
Latest revision as of 01:17, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximately matching polygonal curves with respect to the Fréchet distance |
scientific article |
Statements
Approximately matching polygonal curves with respect to the Fréchet distance (English)
0 references
31 January 2005
0 references
An approximate algorithm for matching point sequences of different lengths under the group of rigid motions is build using a new kind of Fréchet distance, a discrete Fréchet distance. It can be used for matching polygonal curves, subcurves, closed curves and finding longest common subcurves.
0 references
Fréchet distance
0 references
matching polygonal curves
0 references
time complexity
0 references
Geometric pattern matching
0 references
0 references
