Data structure based on Gray code encoding for graphics and image processing
D. J. Amalraj, N. Sundararajan, Goutam Dhar · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1990
A data structure based on the Gray code is presented which while maintaining the computational efficiency of linear quadtrees requires less storage memory. Unlike linear quadtrees where one can condense only to squares of 2hierarchically code can condense the adjoining black nodes to rectangles of the size 2'' x 2 . Due to this data can be condensed to a greater extent using Gray code. Algorithms for condensed encoded Gray code structure are similar to those of linear quadtrees. This paper presents algorithms for Gray code encoding comparing members adjacency and neighbour finding condensing data component labelling area and perimeter calculations.