In this paper, we put forward a region representation data structure-digital search tree (DST) and its lineal encoding (LDST).
本文提出一种用于区域表达的数据结构——数字搜索树(DST)及其线性化编码(LDST)。
The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.
最后，本文还给出了LDST与线性四叉树之间的转换算法及时间复杂度分析。
The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.
最后，本文还给出了LDST与线性四叉树之间的转换算法及时间复杂度分析。
应用推荐