A Note on Neighbor Finding in Images Reoresented by Quadtrees

Abstract

Neighbor finding is one of the most important spatial operations in the field of spatial data structures.A blocl B is said to be the neighbor of another block A, if block B has the same property as block A has and covers an equal size neighbor of block A. Jozef Voros has proposed a neighbor finding strategy on images represented by quadtrees, in which the four equalsized neighbors (the east, west, north, and south directions) of block A can befound. However, based on voros's strategy, the case that the nearest neighbor occurs in the diagonal directions (the northeast, northwest, southeast, and southwest directions) will be ignored. therefore, in this paper, we first show the missing case. Next, we show how to find the missing cases.