Region Representation: Raster-to-Quadtree Conversion

Abstract

An algorithm is presented for constructing a quadtree for a binary image given its row-by-row description. The algorithm processes the image one row at a time and merges identically colored sons as soon as possible so that a minimal size quadtree exists after processing each pixel. This method is spacewise superior to one which reads in an entire array and then attempts to build the quadtree. Analysis of the algorithm reveals that its execution time is proportonal to the number of pixels comprising the image.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1979
Accession Number
ADA078086

Entities

People

  • Hanan Samet

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computational Science
  • Computer Graphics
  • Computer Science
  • Computers
  • Construction
  • Decomposition
  • Graphics
  • Image Processing
  • Language
  • Maryland
  • New York
  • Pattern Recognition
  • Quadrants
  • Terminals
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Vision.
  • Theoretical Analysis.