Accession Number:

ADA076350

Title:

Region Representation: Quadtrees from Boundary Codes

Descriptive Note:

Technical rept.

Corporate Author:

MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER

Personal Author(s):

• Samet, Hanan

Report Date:

1979-03-01

Pagination or Media Count:

40.0

Abstract:

An algorithm is presented for constructing a quadtree for a region given its boundary in the form of a chain code. The algorithm makes use of some geometrical properties of the region to enable the detection of the maximal size blocks of the region without actually visiting all of the subblocks of the maximal size block. 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. Author

Descriptors:

• *INFORMATION THEORY
• *PATTERN RECOGNITION
• ALGORITHMS
• BOUNDARIES
• COMPUTER APPLICATIONS
• DETECTION
• IMAGE PROCESSING
• MACHINE CODING

Subject Categories:

• Computer Programming and Software
• Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE