Skip to main content
SpringerLink
Log in

ECO Method and the Exhaustive Generation of Convex Polyominoes

  • Conference paper
  • First Online:
Discrete Mathematics and Theoretical Computer Science (DMTCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2731))

Abstract

ECO is a method for the enumeration of classes of combinatorial objects based on recursive constructions of such classes. In this paper we use the ECO method and the concept of succession rule to develop an algorithm for the exhaustive generation of convex polyominoes. Then we prove that this algorithm runs in constant amortized time.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banderier, C., Bousquet-Mélou, M., Denise, A., Flajolet, P., Gardy, D., Gouyou-Beauchamps, D.: On generating functions of generating trees. Proceedings of 11th FPSAC (1999) 40–52

    Google Scholar 

  2. Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from their horizontal and vertical projections. Theor. Comp. Sci. 155 (1996) 321–347

    Article  MATH  Google Scholar 

  3. Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: ECO: A methodology for the Enumeration of Combinatorial Objects. J. Diff. Eq. and App. 5 (1999) 435–490

    Article  MATH  Google Scholar 

  4. Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: Random generation of trees and other combinatorial objects. Theor. Comp. Sci. 218 (1999) 219–232

    Article  MATH  Google Scholar 

  5. Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: Some combinatorial interpretations of q-analogs of Schröder numbers. Annals of Combinatorics 3 (1999) 173–192

    Article  Google Scholar 

  6. Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete Comput. Geom. 6 (1991) 575–592

    Article  MATH  MathSciNet  Google Scholar 

  7. Bousquet-Mélou, M.: Convex Polyominoes and Algebraic Languages. J. Phys. A: Math. Gen. 25 (1992) 1935–1944

    Article  MATH  Google Scholar 

  8. Chaiken, S., Kleitman, D.J., Saks, M., Shearer, J.: Covering regions by rectangles. SIAM J. Discr. and Alg. Meth. 2 (1981) 394–410

    Article  MATH  MathSciNet  Google Scholar 

  9. Chang, S.J., Lin, K.Y.: Rigorous results for the number of convex polygons on the square and honeycomb lattices. J. Phys. A: Math. Gen. 21 (1988) 2635–2642

    Article  MathSciNet  Google Scholar 

  10. Conway, J.H., Lagarias, J.C.: Tiling with polyominoes and combinatorial group theory. J. of Comb. Theory A 53 (1990) 183–208

    Article  MATH  MathSciNet  Google Scholar 

  11. Delest, M., Viennot, X.G.: Algebraic languages and polyominoes enumeration. Theor. Comp. Sci. 34 (1984) 169–206

    Article  MATH  MathSciNet  Google Scholar 

  12. Ferrari, L., Pergola, E., Pinzani, R., Rinaldi, S.: An algebraic characterization of the set of succession rules. In Mathematics and Computer Science (D. Gardy and A. Mokkadem Eds.) Birkhauser (2000) 141–152

    Google Scholar 

  13. Ferrari, L., Pergola, E., Pinzani, R., Rinaldi, S.: Jumping succession rules and their generating functions. (to appear)

    Google Scholar 

  14. Golomb, S.W.: Checker boards and polyominoes, Amer. Math. Monthly 6110 (1954) 675–682

    Article  MATH  MathSciNet  Google Scholar 

  15. Hochstätter, W., Loebl, M., Moll, C.: Generating convex polyominoes at random. Disc. Math. 153 (1996) 165–176

    Article  Google Scholar 

  16. Redelmeier, D.H.: Counting polyominoes: yet another attack. Disc. Math. 36 (1981) 191–203

    MATH  MathSciNet  Google Scholar 

  17. Sloane, N.J.A., Plouffe, S.: The Encyclopedia of Integer Sequences. Academic Press, New York (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Matematiche ed Informatiche, Via del Capitano, 15, 53100, Siena, Italy

    Alberto Del Lungo, Andrea Frosini & Simone Rinaldi

Authors
  1. Alberto Del Lungo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Frosini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Simone Rinaldi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, Maths-Physics Building 303, 38 Princes St., Auckland, New Zealand

    Cristian S. Calude  & Michael J. Dinneen  & 

  2. Université de Bourgogne, LE2I, B.P. 47870, 21078, Dijon Cedex, France

    Vincent Vajnovszki

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Del Lungo, A., Frosini, A., Rinaldi, S. (2003). ECO Method and the Exhaustive Generation of Convex Polyominoes. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds) Discrete Mathematics and Theoretical Computer Science. DMTCS 2003. Lecture Notes in Computer Science, vol 2731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45066-1_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45066-1_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40505-4

  • Online ISBN: 978-3-540-45066-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation