Data reduction of piecewise linear curves
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].
- Data point selection for piecewise linear curve approximation
- Data reduction of polygonal curves using B-splines.
- A new subdivision based approach for piecewise smooth approximation of 3D polygonal curves
- A data reduction algorithm for planar curves
- scientific article; zbMATH DE number 3474744 (Why is no real title available?)
- Polygonal approximation by boundary reduction
- Robust nonparametric data approximation of point sets via data reduction
- Place the vertices anywhere on the curve and simplify
This page was built for publication: Data reduction of piecewise linear curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4356933)
