TY - JOUR
T1 - On approaches to polygonal decomposition for hierarchical image representation
AU - Ahuja, Narendra
N1 - Funding Information:
The support of the Joint Services Electronics Program (U.S. Army, U.S. Navy, and U.S. Air Force) under Contract NO001479-C-0424 is gratefully acknowledged, as is the help of Mary Foster in preparing this paper.
PY - 1983/11
Y1 - 1983/11
N2 - Approaches to polygonal decomposition for hierarchical image representation are described. For planar decomposition, quad trees using square and triangular neighborhoods are found to be the only feasible methods, having the same computational complexity. For rigid images the choice of the appropriate tree type is determined by the grid topology. Triangular and square quad trees are appropriate for the triangular and square grids, whereas trees of order 7 are necessary for the hexagonal grid.
AB - Approaches to polygonal decomposition for hierarchical image representation are described. For planar decomposition, quad trees using square and triangular neighborhoods are found to be the only feasible methods, having the same computational complexity. For rigid images the choice of the appropriate tree type is determined by the grid topology. Triangular and square quad trees are appropriate for the triangular and square grids, whereas trees of order 7 are necessary for the hexagonal grid.
UR - http://www.scopus.com/inward/record.url?scp=0021031328&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021031328&partnerID=8YFLogxK
U2 - 10.1016/0734-189X(83)90043-9
DO - 10.1016/0734-189X(83)90043-9
M3 - Article
AN - SCOPUS:0021031328
SN - 0734-189X
VL - 24
SP - 200
EP - 214
JO - Computer Vision, Graphics, and Image Processing
JF - Computer Vision, Graphics, and Image Processing
IS - 2
ER -