Transparent Management of Adjacencies in the Cubic Grid.

We propose an integrated data structure which represents, at the same time, an image in the cubic grid and three well-composed images, homotopy equivalent to it with face-, edge- and vertex-adjacency. After providing an algorithm to build the structure, we present examples showing how, thanks to such data structure, image processing algorithms can be written in a transparent way w.r.t. the adjacency type. Applications include rapid prototyping and teaching.