Region representation: quadtrees from boundary codes

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.

[1]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  G. M. Hunter,et al.  Linear transformation of pictures represented by quad trees , 1979 .

[3]  Michael L. Rhodes,et al.  Organization and Access of Image Data by Areas , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Hanan Samet,et al.  An Algorithm for Converting Rasters to Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Azriel Rosenfeld,et al.  Region representation: boundary codes from quadtrees , 1980, CACM.

[6]  Gregory Michael Hunter,et al.  Efficient computation and data structures for graphics. , 1978 .

[7]  Friedrich L. Bauer,et al.  Report on the algorithmic language ALGOL 60 , 1960, Commun. ACM.

[8]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1959, Commun. ACM.

[9]  Friedrich L. Bauer,et al.  Revised report on the algorithm language ALGOL 60 , 1963, CACM.