APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
From MaRDI portal
Publication:4880210
DOI10.1142/S0218195996000058zbMath0851.68110MaRDI QIDQ4880210
No author found.
Publication date: 10 November 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Related Items (29)
Embedding ray intersection graphs and global curve simplification ⋮ SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE ⋮ Area-preserving approximations of polygonal paths ⋮ Polygonal approximation of closed discrete curves ⋮ Distance-preserving approximations of polygonal paths ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling ⋮ Continuous location of dimensional structures. ⋮ Representing a functional curve by curves with fewer peaks ⋮ Consistent simplification of polyline tree bundles ⋮ The equipartition of curves ⋮ Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs ⋮ Optimal simplification of polygonal chains for subpixel-accurate rendering ⋮ Place the Vertices Anywhere on the Curve and Simplify ⋮ Fitting rectilinear polgonal curves to a set of points in the plane. ⋮ Computing melodic templates in oral music traditions ⋮ Data reduction of large vector graphics ⋮ Farthest-point queries with geometric and combinatorial constraints ⋮ Polygonal chain approximation: A query based approach ⋮ Speeding up simplification of polygonal curves using nested approximations ⋮ Unnamed Item ⋮ An efficient evolutionary algorithm for accurate polygonal approximation ⋮ Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance ⋮ Global Curve Simplification ⋮ Progressive simplification of polygonal curves ⋮ On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance ⋮ Polygonal path simplification with angle constraints ⋮ Extremal point queries with lines and line segments and related problems ⋮ Efficient algorithms for 3-D polygonal approximation based on LISE criterion
This page was built for publication: APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
