Computing Perimeters of Images Represented by Quadtrees

Abstract

An algorithm is presented for computing the total perimeter of a binary image represented by a quadtree. The algorithm explores each segment of the border once and only once. Analysis of the algorithm shows that its worst- case average execution time is proportional to the product of the log of the image diameter and the number of nodes in the tree.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1979
Accession Number
ADA078083

Entities

People

  • Hanan Samet

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computations
  • Computer Science
  • Decomposition
  • Diameters
  • Maryland
  • Quadrants
  • Terminals
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.