Finding Neighbours in -Dimensional Binary Digital Images Represented by Bintrees

Author’s present address: GLUE Software Engineering, Ralligweg 10, CH-3012 Bern, email: [email protected], Tel +41 31 305 03 11, Fax +41 31 301 44 33 An algorithm for moving between adjacent regions in a binary digital image representated by a bintree is presented. This algorithm differs from other neighbour–finding algorithms in hierarchical image representations, as it exploits the nature of bintrees and thus can perform independently of any specific dimension of image or space. The algorithm is hybrid in its nature, as it uses a linear tree notation (locational codes) to find its way in a tree implemented with pointers.