Discrete objects are sets of pixels, voxels or their analog in higher dimension. A three-dimensional discrete object can contain holes such as tunnels, handles or cavities. Opening the holes of an object consists in erasing all its holes by removing some parts of it. The main idea is to take a point of the object and to dilate it inside the object without changing its homotopy type: the remaining points in the object are those which have to be removed. This process does not require the computation of the homology groups of the object and is only based on the identification of simple points. In this experimental paper we propose two algorithms for opening the holes of a discrete object endowed with any adjacency relation in arbitrary dimension. Both algorithms are based on the distance transform of the object and differ in how the dilation is performed, favoring either time complexity or the quality of the output. Moreover, these algorithms contain a parameter that controls the thickness of the removed parts.
展开▼
