Digital connectedness via connectivity graph

Introduces a new image data structure, the connectivity graph (CG), obtained from the cylindrical algebraic decomposition of digital planes. The connectivity graph provides a structural representation of binary images. Some typical shape problems can be solved by using the connectivity graph, e.g. the search of connected components and the visibility problem. The computation of the Euler number of a binary image, via CG is analysed in detail.<
>