Streaming algorithms for line simplification

DOI10.1007/S00454-008-9132-4MaRDI QIDQ5919922zbMATH OpenOpenAlexFDO

Authors Mohammad A. Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei

Publication date 12 April 2010

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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)

Recommendations

• Streaming algorithms for line simplification
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• scientific article; zbMATH DE number 1947379
• Near-linear time approximation algorithms for curve simplification

Cites work

• scientific article; zbMATH DE number 4026646 (Why is no real title available?)
• scientific article; zbMATH DE number 4074316 (Why is no real title available?)
• scientific article; zbMATH DE number 176499 (Why is no real title available?)
• A space-optimal data-stream algorithm for coresets in the plane
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Cartographic line simplification and polygon CSG formulae in O(n^* n) time
• Data streams: algorithms and applications.
• Efficient algorithms for approximating polygonal chains
• Efficient piecewise-linear function approximation using the uniform metric
• Fitting polygonal functions to a set of points in the plane
• Near-linear time approximation algorithms for curve simplification

Cited in

(11)

• Place the vertices anywhere on the curve and simplify
• scientific article; zbMATH DE number 7559218 (Why is no real title available?)
• Global Curve Simplification
• Compressing spatio-temporal trajectories
• Computing homotopic line simplification
• Streaming algorithms for line simplification
• Embedding ray intersection graphs and global curve simplification
• Minimum-complexity graph simplification under the Fréchet-like distance
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Shortcut hulls: vertex-restricted outer simplifications of polygons
• Efficient observer-dependent simplification in polygonal domains

This page was built for publication: Streaming algorithms for line simplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919922)