Fast algorithm for error-bounded compression of digital curves

A fast algorithm for compression of digital curves with minimal bitrate for a given error-bound was considered. The algorithm includes polygonal approximation with quantization of the vector data and compression of the quantized data with arithmetic encoder An asymptotically optimal quantizer for vector data was constructed with a quantization step proportional to the given RMSE bound. The proposed algorithm has demonstrated good compression and time performance on large-size data. The algorithms can be used in real-time applications and adapted for on-line implementation.