Abstract
In the literature most counting problems for directed columnconvex polyominoes are solved by using Schutzenberger's method. In this paper, we use the traditional recurrence relation approach in order to count the number of directed column-convex polyominoes with a given area, the number of their columns and the number of directed columnconvex polyominoes having at most κ cells in the first column. This approach allows us to state a very simple algorithm for the random generation of directed column-convex polyominoes. Furthermore, directed column-convex polyominoes are considered to be structures for storing and retrieving information in a computer, and their average internal path length is then evaluated.
Chapter PDF
Similar content being viewed by others
References
E. Barcucci, R. Pinzani, E. Rodella, R. Sprugnoli: A Characterization of Binary Search Networks. In: L. Budach (ed.): Foundamentals of Computation Theory. Lecture Notes in Computer Science 529. Berlin: Springer 1991, pp. 126–135
E. Barcucci, R. Pinzani, R. Sprugnoli: Génération Aléatoire des Animaux Dirigés. In: J. Labelle, J.-G. Penaud (eds.): Atelier de Combinatoire Franco-Quebécois. Publications du LACIM. Montréal 1991, pp.17–25
E. Barcucci, R. Pinzani, R. Sprugnoli: The Random Generation of Underdiagonal Walks. In: P. Leroux, C. Reutenauer (eds.): Séries Formelles et Combinatoire Algébrique. Publications du LACIM 11. Montréal 1992, pp. 17–32
M. P. Delest, S. Dulucq: Enumeration of Directed Column-convex Animals with Given Perimeter and Area. Rapport LaBRI 87-15. Université de Bordeaux I 1987
T. Hickey, J. Cohen: Uniform Random Generation of Strings in a Context-Free Language. SIAM J. Comput. 12, 645–655 (1983)
D. E. Knuth: The Art of Computer Programming, Vol. I–III. Addison-Wesley, Reading, Ma, 1968–1973
X. G. Viennot: A Survey of Polyomino Enumeration. In: P. Leroux, C. Reutenauer (eds.): Séries Formelles et Combinatoire Algébrique. Publications du LACIM 11. Montréal 1992, pp. 399–420
T. Yuba, M. Hoshi: Binary Search Networks: a New Method for Key Searching. Information Processing Letters 24, 59–65 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barcucci, E., Pinzani, R., Sprugnoli, R. (1993). Directed column-convex polyominoes by recurrence relations. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_71
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive