Recognition of Digital Naive Planes and Polyhedrization

A digital naive plane may be seen as a repetition of (n, m)- cubes, set composed of n×m adjacent voxels or more generally sets of p voxels. In a previous works, we have shown how to link the parameters of a naive plane to the different configurations of voxels sets by the construction of the associated Farey net. We propose an algorithm to recognize any set of coplanar voxels. This algorithm will be used for the polyhedrization of voxel objects. This is an original contribution offering a new method for digital plane recognition.