An Algorithm for Converting Rasters to Quadtrees

Key Points

Key points are not available for this paper at this time.

Abstract

An algorithm is presented for constructing a quadtree for a binary image given its row-by-row description. The algorithm processes the image one row at a time and merges identically colored sons as soon as possible, so that a minimal size quadtree exists after processing each pixel. This method is spacewise superior to one which reads in an entire array and then attempts to build the quadtree.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Cite This Study

Hanan Samet (Thu,) studied this question.

synapsesocial.com/papers/6a2085d1ca5c5b2ddfa5eb82 https://doi.org/https://doi.org/10.1109/tpami.1981.4767054

Discussion

Journals

IEEE Transactions on Pattern Analysis and Machine Intelligence

Institutions

University of Maryland, College Park

References and Citations

Add This Paper to Your Research Feed

Any time a new paper drops it will be there.