多边形链式编码方式的改进及其编码方法

由于链式编码以每个区域为单位存储边界,相邻区域的边界被重复存储,所以通过索引机制来检查是否存在多余的多边形,从而避免相邻边界被重复保存。基于多边形拓扑关系的算法,对多边形图形链式编码方式提出了一种改进算法,采用二叉树编码、霍夫曼原理,将链式编码进行了重新编码并转换成可运算的多边形矢量编码,实现了多边形图形的叠置运算功能,同时提高了链式编码方式的数据压缩效率。

Improvement of polygonal graphics chain coding and encoding method thereof

Because the chain code to each region as a unit of storage boundary, adjacent region boundary is repeated memory, so the index mechanism to check for the presence of redundant polygon, so as to avoid the adjacent boundary was saved repeat- edly. Polygon topology based on the algorithm, an improved algorithm for polygon chain coding method is proposed, using two forks tree coding and Hoffman theory , the chain code to code and converted into polygon vector coding can be operation, the polygon overhty operation function, but also improve the chain encoding data compression efficiency.