Abstract
A planar polyomino of size n is an edge-connected set of n squares on a rectangular 2-D lattice. Similarly, a d-dimensional polycube (for d ≥2) of size n is a connected set of n hypercubes on an orthogonal d-dimensional lattice, where two hypercubes are neighbors if they share a (d–1)-dimensional face. There are also two-dimensional polyominoes that lie on a triangular or hexagonal lattice. In this paper we describe a generalization of Redelmeier’s algorithm for counting two-dimensional rectangular polyominoes [Re81], which counts all the above types of polyominoes. For example, our program computed the number of distinct 3-D polycubes of size 18. To the best of our knowledge, this is the first tabulation of this value.
Work on this paper by the second author has been supported in part by the European FP6 Network of Excellence Grant 506766 (AIM@SHAPE).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Broadbent, S.R., Hammersley, J.M.: Percolation processes: I. Crystals and mazes. Proc. Cambridge Philosophical Society 53, 629–641 (1957)
The online encyclopedia of integer sequences, http://www.research.att.com/~njas/sequences
Jensen, I.: Enumerations of lattice animals and trees. J. of Statistical Physics 102, 865–881 (2001)
Jensen, I.: Counting polyominoes: A parallel implementation for cluster computing. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2659, pp. 203–212. Springer, Heidelberg (2003)
Lunnon, W.F.: Counting polyominoes. In: Atkin, A.O.L., Birch, B.J. (eds.) Comp. in Number Theory, pp. 347–372. Academic Press, London (1971)
Lunnon, W.F.: Counting hexagonal and triangular polyominoes. In: Read, R.C. (ed.) Graph Theory and Comp., pp. 87–100. Academic Press, New York (1972)
Lunnon, W.F.: Symmetry of cubical and general polyominoes. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 101–108. Academic Press, New York (1972)
Lunnon, W.F.: Counting multidimensional polyominoes. The Computer Journal 18, 366–367 (1975)
Martin, J.L.: Computer techniques for evaluating lattice constants. In: Domb, C., Green, M.S. (eds.) Phase Transitions and Critical Phenomena, vol. 3, pp. 97–112. Academic Press, London (1974)
Redelmeier, D.H.: Counting polyominoes: Yet another attack. Discrete Mathematics 36, 191–203 (1981)
Sykes, M.F., Gaunt, D.S., Glen, M.: Percolation processes in three dimensions. J. of Physics, A: Math. and General 10, 1705–1712 (1976)
Vöge, M., Guttmann, A.J.: On the number of hexagonal polyominoes. Theoretical Computer Science 307, 433–453 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aleksandrowicz, G., Barequet, G. (2006). Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_44
Download citation
DOI: https://doi.org/10.1007/11809678_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)