本文提出并分析了2DRE四叉树到栅格结构的变换算法。这一算法可看作栅格—2DRE四叉树变换算法的逆变换,但不是它的“反演”,而是采用了较为简洁的求交集运算以及栅格—2DRE四叉树变换算法中的编码转换方法,使得这一算法的实现更加有效,且避免了在图像较大而内存较小的情况下可能发生的“溢出”等矛盾。 This paper presents and analyzes the 2DRE quadtree to grid structure transformation algorithm. This algorithm can be seen as the inverse of the raster-2DRE quadtree transform algorithm, but not its “inversion”, but rather a simpler intersection algorithm and the raster-2DRE quadtree algorithm The code conversion method makes the realization of this algorithm more effective and avoids such contradictions as “overflow” that may occur in the case of large images and small memory.