Abstract
Polyhedral tilings are often used to represent structures such as atoms in materials, grains in crystals, foams, galaxies in the universe, etc. In the previous paper, we have developed a theory to convert a way of how polyhedra are arranged to form a polyhedral tiling into a codeword (series of numbers) from which the original structure can be recovered. The previous theory is based on the idea of forming a polyhedral tiling by gluing together polyhedra face to face. In this paper, we show that the codeword contains redundant digits not needed for recovering the original structure, and develop a theory to reduce the redundancy. For this purpose, instead of polyhedra, we regard two-dimensional regions shared by faces of adjacent polyhedra as building blocks of a polyhedral tiling. Using the present method, the same information is represented by a shorter codeword whose length is reduced by up to the half of the original one. Shorter codewords are easier to handle for both humans and computers, and thus more useful to describe polyhedral tilings. By generalizing the idea of assembling two-dimensional components to higher dimensional polytopes, we develop a unified theory to represent polyhedral tilings and polytopes of different dimensions in the same light.