Access Restriction

Author Samet, Hanan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Quadtrees ♦ Data structures ♦ Regions ♦ Borders ♦ Chain codes
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.
Description Affiliation: Univ. of Maryland, College Park (Samet, Hanan)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 23
Issue Number 3
Page Count 8
Starting Page 163
Ending Page 170

Open content in new tab

   Open content in new tab
Source: ACM Digital Library