Decomposition of a Three‐Dimensional Discrete Object Surface into Discrete Plane Pieces

This paper deals with the polyhedrization of discrete volumes. The aim is to do a reversible transformation from a discrete volume to a Euclidean polyhedron, i.e. such that the discretization of the Euclidean volume is exactly the initial discrete volume. We propose a new polynomial algorithm to split the surface of any discrete volume into pieces of naive discrete planes with well‐defined shape properties, and present a study of the time complexity as well as a study of the influence of the voxel tracking order during the execution of this algorithm.