摘要
本文介绍以数字搜索树（ＤＳＴ）表示的二值图象的一种几何变换算法．文中讨论了四分区与正四边区的基本关系、输出ＤＳＴ结点成立的充分条件，给出了完整的几何变换算法并对算法的复杂性作了分析．
In this paper,a geometrical transformation algorithm of binary images represented by digital search tree(DST)is presented.The main relations of quadrants and quadangles,and the sufficient conditions of producing output DST nodes are discussed. In addition,an integrated algorithm is introduced, and its complexity is analysed.
出处
《计算机学报》
EI
CSCD
北大核心
1994年第4期298-302,共5页
Chinese Journal of Computers
关键词
四叉树
数字搜索树
二值图象
Quadtree
linear quadtree
digital search tree
geometrical transformation
