ACM

Communications of the ACM

Home/Magazine Archive/March 1980 (Vol. 23, No. 3)/Region representation: quadtrees from boundary codes/Abstract

Region representation: quadtrees from boundary codes

By Hanan Samet
Communications of the ACM, March 1980, Vol. 23 No. 3, Pages 163-170
10.1145/358826.358836
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.