Neighbor Finding Techniques for Images Represented by Quadtrees

摘要

A number of different techniques are presented for moving between adjacent blocks in an image represented by a quadtree. These adjacencies may be in the horizontal, vertical, or diagonal directions. Algorithms are given and their execution time is analyzed using a suitably defined model. (Author)