This paper presents a new filling algorithm for vertex chain code.
该文提出一种填充算法，解决了顶点链编码表示区域的填充问题。
Algorithms are proposed for tracing boundary and extracting vertex chain code and obtaining the tree structure of contours from 8-adjacent and 4-adjacent images.
分别就八近邻图像和四近邻图像给出了边界跟踪、顶点链码抽取及围线树结构的生成算法。
Algorithms are proposed for tracing boundary and extracting vertex chain code and obtaining the tree structure of contours from 8-adjacent and 4-adjacent images.
分别就八近邻图像和四近邻图像给出了边界跟踪、顶点链码抽取及围线树结构的生成算法。
应用推荐