从线性四元树中轴变换重建线性四元树

RECONSTRUCTION OF LINEAR QUADTREES FROM LINEAR QUADTREE MEDIAL AXIS TRANSFORMS

Linear quadtree medial axis transforms offer a compact and exact region representation. However, it is not suited to some image processing operations such as thinning. Two algebraic algorithms are presented which recon struct a linear quadtree from its linear quadtree medial axis transform. Algorithm 2 also serves to reinforce the appropriateness of the definition of the linear quadtree skeleton, which permits a quadrant in the linear quadtree to require more than one element of the linear quadtree skeleton for its subsump-tion. It is proved that the linear quadtree corresponding to a linear quadtree medial axis transform is unique.