Streaming algorithms for line simplification

DOI10.1007/s00454-008-9132-4zbMath1186.68485OpenAlexW2029619478MaRDI QIDQ5919922

Mohammad Ali Abam, Peter Hachenberger, Alireza Zarei, Mark T. de Berg

Publication date: 12 April 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-008-9132-4

zbMATH Keywords

streaming algorithmsline simplification

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Embedding ray intersection graphs and global curve simplification ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Computing homotopic line simplification ⋮ Place the Vertices Anywhere on the Curve and Simplify ⋮ Unnamed Item ⋮ Global Curve Simplification ⋮ On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-linear time approximation algorithms for curve simplification
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
• Efficient piecewise-linear function approximation using the uniform metric
• Efficient algorithms for approximating polygonal chains
• A space-optimal data-stream algorithm for coresets in the plane
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Fitting polygonal functions to a set of points in the plane
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES