Problem of lossy compression of vector data is considered. We attack the problem by jointly considering data reduction by polygonal approximation and quantization of the prediction errors for approximation nodes. Optimal algorithms proposed for vector data encoding with minimal distortion for given target bit-rate, and with minimal bit-rate for given maximum deviation. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kolesnikov, A. (2005). Optimal encoding of vector data with polygonal approximation and vertex quantization. In Lecture Notes in Computer Science (Vol. 3540, pp. 1186–1195). Springer Verlag. https://doi.org/10.1007/11499145_120
Mendeley helps you to discover research relevant for your work.