Neighbour finding in images represented by octrees

Abstract

Algorithms are presented for moving between adjacent blocks in an octree representation of an image. Motion is possible in the direction of a face, edge, and a vertex, and between blocks of arbitrary size. The algorithms are based on a generalization and simplification of techniques developed earlier for two dimensions (i.e., in quadtrees). They are also applicable to quadtrees. The difference lies in the graph-theoretical classification of adjacencies-i.e., in terms of vertices, edges, and faces. Algorithms are given for octrees that are implemented with pointers and with pointerless representations such as the linear octree. 0 1989 Academic PRSS. ITIC. 1