Region Representation: Quadtrees from Boundary Codes
Hanan Samet · 1979
An algorithm is presented for constructing a quadtree for a region given its boundary in the form of a chain code. Analysis of the algorithm reveals that its execution time is proportional to the product of the perimeter and the log of the diameter of the region