Approximately matching polygonal curves with respect to the Fréchet distance (Q705548)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximately matching polygonal curves with respect to the Fréchet distance |
scientific article; zbMATH DE number 2131602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximately matching polygonal curves with respect to the Fréchet distance |
scientific article; zbMATH DE number 2131602 |
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
0.8712661862373352
0 references
0.870463490486145
0 references
