Region representation

Key Points

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

Abstract

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.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Cite This Study

Hanan Samet (Sat,) studied this question.

synapsesocial.com/papers/6a1c8cd1ecffbcc5fca17cdf https://doi.org/https://doi.org/10.1145/358826.358836

Discussion

Journals

Communications of the ACM

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.