Tree and Pyramid Structures for Coding Hexagonally Sampled Binary Images

Abstract

Tree and pyramid type data structures are described which may be used for storing and processing binary images that have been sampled on a hexagonal grid. These are analogous to the quadtrees and pyramids which have recently been developed for images sampled on a rectangular grid. Trees may be formed with 3, 4, 7, 9 ... branches per node. Of these the 'septtree', formed with 7 branches per node, promises to be particularly interesting since each node 'covers' a roughly hexagonal region of the image.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1979
Accession Number
ADA086099

Entities

People

  • Peter J. Burt

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Arrays (Data Structures)
  • Buildings And Structures
  • Computer Programming
  • Computer Science
  • Computer Vision
  • Computers
  • Contracts
  • Coordinate Systems
  • Digital Information
  • Generators
  • Grids
  • Image Processing
  • Maryland
  • Night Vision
  • Rotation
  • Trees (Data Structures)
  • Universities

Readers

  • Computer Vision.
  • Graph Algorithms and Convex Optimization.