Improved algorithm for vector data compression based on dynamic programming

DOI10.3724/SP.J.1087.2008.00168MaRDI QIDQ3185431zbMATH OpenOpenAlexFDO

Authors

Publication date 26 October 2009

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2008.00168

zbMATH Keywords

dynamic programming algorithmvector data compressionDouglas-peucker algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Dynamic programming (90C39) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• A cubic B-spline-based vector data compression algorithm with boundary constraints
• Computational Science - ICCS 2004
• Review on trajectory data compression
• Data reduction of large vector graphics
• Compressing spatio-temporal trajectories

Cited in

(4)

• A new grid-cell-based method for error evaluation of vector-to-raster conversion
• A cubic B-spline-based vector data compression algorithm with boundary constraints
• Computational Science - ICCS 2004
• A point cloud clustering compression algorithm for spatial statistical data based on cloud computing

This page was built for publication: Improved algorithm for vector data compression based on dynamic programming

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