Quadtrees

the data structure developed in recent years

have advantages in expressing structure and compressing the space of storage while Chaincode-Vector are the data structure used to detect and describe the edges and shapes of fields in an image

so both of them have their own advantages and disadvantages in different situations. This paper advances and analyses an algorithm of converting 2DRE Quadtree to Vector

which abstracts the edges of fields in an image from its 2DRE Quadtree. The fields’ edges are represented in the form of coordinates of vectors for displaying the fields’ shape and outputting the vectors easily. In this paper

the base of the algorithm is introduced first; then the algorithm is described in detail; finally the features and practical results of the algorithm are estimated and analysed.