Presentation 1997/4/25
A Graph Grammar for Non-Uniform Quadtrees
Kunio Aizawa, Akira Nakamura,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The non-uniform quadtree, which divides a given quadrant into four unequal rectangles instead of equal squares, yield more compact region representations than quadtrees and it also decreases shift sensitivity of quadtree representations. However those non-uniform subdivisions endanger the nice properties of the quadtree representation, e.g., all neighbors of the given region are recognized by a simple tree traverse within a few steps. In this paper, we will introduce a graph grammar based on nPCE graph grammars. By spanning some additional links into a quadtree, the graph grammar can describe all adjacency relations within a given non-uniform quadtree.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) quadtree / graph grammar / path-controlled embedding / digital image
Paper # COMP97-3
Date of Issue

Conference Information
Committee COMP
Conference Date 1997/4/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Graph Grammar for Non-Uniform Quadtrees
Sub Title (in English)
Keyword(1) quadtree
Keyword(2) graph grammar
Keyword(3) path-controlled embedding
Keyword(4) digital image
1st Author's Name Kunio Aizawa
1st Author's Affiliation Department of Applied Mathematics, Hiroshima University()
2nd Author's Name Akira Nakamura
2nd Author's Affiliation Department of Computer Science, Meiji University
Date 1997/4/25
Paper # COMP97-3
Volume (vol) vol.97
Number (no) 32
Page pp.pp.-
#Pages 7
Date of Issue