scientific article
From MaRDI portal
Publication:3805737
zbMath0657.65025MaRDI QIDQ3805737
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
graph theorycomputational geometryconvex hullsefficient algorithmserror criteriacomputationally efficient algorithmpolygonal approximations of curves
Related Items (28)
Embedding ray intersection graphs and global curve simplification ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ 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 ⋮ Approximating ( k,ℓ )-Median Clustering for Polygonal Curves ⋮ Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance ⋮ Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Unnamed Item ⋮ The equipartition of curves ⋮ Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs ⋮ Linear approximation of simple objects ⋮ Computing homotopic line simplification ⋮ Fitting rectilinear polgonal curves to a set of points in the plane. ⋮ Polygonal chain approximation: A query based approach ⋮ Speeding up simplification of polygonal curves using nested approximations ⋮ Unnamed Item ⋮ Linear approximation of simple objects ⋮ Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance ⋮ Streaming algorithms for line 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 ⋮ Hausdorff approximation of convex polygons ⋮ Efficient algorithms for 3-D polygonal approximation based on LISE criterion
This page was built for publication:
