Region Representation: Quadtrees from Boundary Codes

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1979
Accession Number
ADA076350

Entities

People

  • Hanan Samet

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Cartography
  • Computations
  • Computer Graphics
  • Computer Science
  • Computers
  • Detection
  • Diameters
  • Graphics
  • Image Processing
  • Maryland
  • New Jersey
  • Night Vision
  • Quadrants
  • Terminals
  • Universities

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.