Skip to main content
SpringerLink
Log in

On the Generation of 2-Polyominoes

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10952))

Included in the following conference series:

Abstract

The class of 2-polyominoes contains all polyominoes P such that for any integer i, the first i columns of P consist of at most 2 polyominoes. We provide a decomposition that allows us to exploit suitable discrete dynamical systems to define an algorithm for generating all 2-polyominoes of area n in constant amortized time and space O(n).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bousquet-Mélou, M.: A method for the enumeration of various classes of column-convex polygons. Discrete Math. 154(1–3), 1–25 (1996)

    Article  MathSciNet  Google Scholar 

  2. Brocchi, S., Castiglione, G., Massazza, P.: On the exhaustive generation of k-convex polyominoes. Theor. Comput. Sci. 664, 54–66 (2017)

    Article  MathSciNet  Google Scholar 

  3. Castiglione, G., Massazza, P.: An efficient algorithm for the generation of Z-convex polyominoes. In: Barneva, R.P., Brimkov, V.E., Šlapal, J. (eds.) IWCIA 2014. LNCS, vol. 8466, pp. 51–61. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07148-0_6

    Chapter  Google Scholar 

  4. Castiglione, G., Restivo, A.: Reconstruction of L-convex polyominoes. Electron. Notes Discrete Math. 12, 290–301 (2003)

    Article  MathSciNet  Google Scholar 

  5. Del Lungo, A., Duchi, E., Frosini, A., Rinaldi, S.: On the generation and enumeration of some classes of convex polyominoes. Electron. J. Comb. 11(1) (2004)

    Google Scholar 

  6. Delest, M.P., Viennot, G.: Algebraic languages and polyominoes enumeration. Theor. Comput. Sci. 34(1–2), 169–206 (1984)

    Article  MathSciNet  Google Scholar 

  7. Formenti, E., Massazza, P.: From tetris to polyominoes generation. Electron. Notes Discrete Math. 59, 79–98 (2017)

    Article  MathSciNet  Google Scholar 

  8. Golomb, S.W.: Checker boards and polyominoes. Am. Math. Monthly 61, 675–682 (1954)

    Article  MathSciNet  Google Scholar 

  9. Jensen, I.: Enumerations of lattice animals and trees. J. Stat. Phys. 102(3), 865–881 (2001)

    Article  MathSciNet  Google Scholar 

  10. 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.J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2659, pp. 203–212. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-44863-2_21

    Chapter  Google Scholar 

  11. Mantaci, R., Massazza, P.: On the exhaustive generation of plane partitions. Theor. Comput. Sci. 502, 153–164 (2013)

    Article  MathSciNet  Google Scholar 

  12. Mantaci, R., Massazza, P.: From linear partitions to parallelogram polyominoes. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 350–361. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22321-1_30

    Chapter  Google Scholar 

  13. Mantaci, R., Massazza, P., Yunès, J.B.: An efficient algorithm for generating symmetric ice piles. Theor. Comput. Sci. 629(C), 96–115 (2016)

    Article  MathSciNet  Google Scholar 

  14. Massazza, P.: On the generation of convex polyominoes. Discrete Appl. Math. 183, 78–89 (2015)

    Article  MathSciNet  Google Scholar 

  15. Privman, V., Barma, M.: Radii of gyration of fully and partially directed lattice animals. Z. Phys. B Condens. Matter 57(1), 59–63 (1984)

    Article  Google Scholar 

  16. Privman, V., Forgacs, G.: Exact solution of the partially directed compact lattice animal model. J. Phys. A Math. Gen. 20(8), L543 (1987)

    Article  MathSciNet  Google Scholar 

  17. Redner, S., Yang, Z.R.: Size and shape of directed lattice animals. J. Phys. A Math. Gen. 15(4), L177 (1982)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Côte d’Azur (UCA), CNRS, I3S, Nice, France

    Enrico Formenti

  2. Department of Theoretical and Applied Sciences - Computer Science Section, Università degli Studi dell’Insubria, Via Mazzini 5, 21100, Varese, Italy

    Paolo Massazza

Authors
  1. Enrico Formenti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo Massazza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Enrico Formenti .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Saint Mary’s University, Halifax, Nova Scotia, Canada

    Stavros Konstantinidis

  2. Dipartimento di Informatica e Comunicazi, Universita degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2018 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Formenti, E., Massazza, P. (2018). On the Generation of 2-Polyominoes. In: Konstantinidis, S., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2018. Lecture Notes in Computer Science(), vol 10952. Springer, Cham. https://doi.org/10.1007/978-3-319-94631-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94631-3_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94630-6

  • Online ISBN: 978-3-319-94631-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation