Efficiently approximating polygonal paths in three and higher dimensions
From MaRDI portal
Publication:1601006
DOI10.1007/s00453-001-0096-5zbMath0994.68048OpenAlexW1981507524MaRDI QIDQ1601006
Danny Z. Chen, Gill Barequet, Ovidiu Daescu, Jack Scott Snoeyink, Michael T. Goodrich
Publication date: 17 June 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7076
Related Items (18)
Approximating points by a piecewise linear function ⋮ Embedding ray intersection graphs and global curve simplification ⋮ Area-preserving approximations of polygonal paths ⋮ Distance-preserving approximations of polygonal paths ⋮ Representing a functional curve by curves with fewer peaks ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ The equipartition of curves ⋮ Finding long and similar parts of trajectories ⋮ Data reduction of large vector graphics ⋮ Polygonal chain approximation: A query based approach ⋮ Unnamed Item ⋮ Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance ⋮ Global Curve Simplification ⋮ 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: Efficiently approximating polygonal paths in three and higher dimensions
