摘要
本文提出一种算法实现单连通区域的线性四元树表示转换成区域边界的4-方向链码描述。首先给出测定水平、垂直和对角方向邻接对的算法。利用这些算法的执行结果,可以定义一个边界四分形的边邻接方向矩阵。采用一组规则驱动该矩降,能够使转换过程用代数方法实现。
An algorithm is presented for converting the linear quadtree representation of a simply connected region into a 4-direction chain code description of the region's boundary. First, algorithms are given for determining such adjacencies in the horizontal, vertical, and diagonal directions. With the results of the algorithms, side adjacency direction matrix for boundary quadrants can be defined. Using a set of rules to drive the matrix, the process for constructing the chain code is algebraically implemented.
出处
《计算机学报》
EI
CSCD
北大核心
1990年第7期498-506,共9页
Chinese Journal of Computers
