A Quadtree Medial Axis Transform
Abstract
The skeleton and medial axis transform concepts used in traditional image processing representations are adapted to the quadtree representation. A new data structure termed the Quadtree Medial Axis Transform (QMAT) is defined. An algorithm is presented for the computation of the QMAT of a given quadtree by only examining each BLACK node's adjacent and abutting neighbors. Analysis of the algorithm reveals an average execution time proportional to the number of leaves in the quadtree. Some of the interesting properties of the QMAT vis a vis the quadtree are its compactness and a decreased shift sensitivity.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1979
- Accession Number
- ADA086097
Entities
People
- Hanan Samet
Organizations
- University of Maryland