Near-linear time approximation algorithms for curve simplification
From MaRDI portal
Publication:818650
DOI10.1007/s00453-005-1165-yzbMath1086.68134MaRDI QIDQ818650
Nabil H. Mustafa, Pankaj K. Agarwal, Yusu Wang, Sariel Har-Peled
Publication date: 21 March 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1165-y
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
68W25: Approximation algorithms
Related Items
VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE, Unnamed Item, Place the Vertices Anywhere on the Curve and Simplify, Global Curve Simplification, On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance, Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance, Unnamed Item, Streaming algorithms for line simplification, A Fast Approximate Skeleton with Guarantees for Any Cloud of Points in a Euclidean Space, Approximating the Fréchet distance for realistic curves in near linear time, Embedding ray intersection graphs and global curve simplification, Computing homotopic line simplification, Progressive simplification of polygonal curves, Four Soviets walk the dog: improved bounds for computing the Fréchet distance, On the Hardness of Orthogonal-Order Preserving Graph Drawing
