Efficient algorithms for approximating polygonal chains
From MaRDI portal
Publication:1971509
zbMath0953.68145MaRDI QIDQ1971509
Kasturi R. Varadarajan, Pankaj K. Agarwal
Publication date: 7 June 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items (16)
On counting point-hyperplane incidences ⋮ Compressing spatio-temporal trajectories ⋮ Curve matching, time warping, and light fields: New algorithms for computing similarity between curves ⋮ Distance-preserving approximations of polygonal paths ⋮ On reverse shortest paths in geometric proximity graphs ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Compressing Spatio-temporal Trajectories ⋮ Optimal simplification of polygonal chains for subpixel-accurate rendering ⋮ Farthest-point queries with geometric and combinatorial constraints ⋮ Polygonal chain approximation: A query based approach ⋮ Streaming algorithms for line simplification ⋮ Representation Complexities of SemiAlgebraic Graphs ⋮ Polygonal path simplification with angle constraints ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Extremal point queries with lines and line segments and related problems ⋮ Hausdorff approximation of convex polygons
This page was built for publication: Efficient algorithms for approximating polygonal chains
