Data reduction of piecewise linear curves (Q4356933)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1070447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Data reduction of piecewise linear curves |
scientific article; zbMATH DE number 1070447 |
Statements
5 March 1998
0 references
data reduction
0 references
piecewise linear curves
0 references
Hausdorff approximation
0 references
0.8352234363555908
0 references
0.8142913579940796
0 references
Data reduction of piecewise linear curves (English)
0 references
The authors note that if a polygonal curve is to be approximated by another polygonal curve with fewer vertices, Hausdorff approximation of the set of vertices is not sufficient; the order of the vertices is important. Nevertheless, Hausdorff metric is easily implemented in computer programs. The authors present a new solution to the problem of the approximation of a given polygonal curve to precision \(\varepsilon\) with a minimum number of vertices by construction of the new vertices not by selection from the old ones but by intersection of angle domains that are very easily handled analytically. For the entire collection see [Zbl 0863.00021].
0 references
