Streaming algorithms for line simplification

DOI10.1145/1247069.1247103MaRDI QIDQ5901404zbMATH OpenOpenAlexFDO

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

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247103

Mathematics Subject Classification ID

Distance geometry (51K99) 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

Cited in

(8)

• Efficient observer-dependent simplification in polygonal domains
• Streaming algorithms for planar convex hulls
• Compressing Spatio-temporal Trajectories
• Streaming algorithms for line simplification
• Dynamic L-budget clustering of curves
• Static and streaming data structures for Fréchet distance queries
• Simplification of trajectory streams
• Compressing spatio-temporal trajectories

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 Q5901404)