Linear Time Calculations of Geometric Properties Using Quadtrees

Abstract

This paper describes algorithms for computing geometric properties of binary images represented as quadtrees. All the algorithms involve a simple traversal of the tree. Each algorithm, however, performs different operations at the nodes of the tree. Algorithms are presented for finding the area, centroid, union, intersection, and complement of binary images. All the algorithms are linear in the number(s) of nodes in the tree(s).

Open PDF

Document Details

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

Entities

People

  • Michael Shneier

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Coordinate Systems
  • Image Processing
  • Night Vision
  • Pattern Recognition
  • Quadrants
  • Recognition
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Vision.
  • Graph Algorithms and Convex Optimization.