Skip to main content
SpringerLink
Log in

Properties of Minimal-Perimeter Polyominoes

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2018)

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

Included in the following conference series:

Abstract

A polyomino is a set of connected squares on a grid. In this paper we address the class of polyominoes with minimal perimeter for their area, and we show a bijection between minimal-perimeter polyominoes of certain areas.

Work on this paper by both authors has been supported in part by ISF Grant 575/15.

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

Notes

  1. 1.

    In the sequel we simply say “monotone increasing.”.

References

  1. Altshuler, Y., Yanovsky, V., Vainsencher, D., Wagner, I.A., Bruckstein, A.M.: On minimal perimeter polyminoes. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 17–28. Springer, Heidelberg (2006). https://doi.org/10.1007/11907350_2

    Chapter  Google Scholar 

  2. Asinowski, A., Barequet, G., Zheng, Y.: Enumerating polyominoes with fixed perimeter defect. In: Proceedings of 9th European Conference on Combinatorics, Graph Theory, and Applications, vol. 61, pp. 61–67. Elsevier, Vienna, August 2017

    Article  Google Scholar 

  3. Barequet, G., Rote, G., Shalah, M.: \(\lambda > 4\): an improved lower bound on the growth constant of polyominoes. Commun. ACM 59(7), 88–95 (2016)

    Article  Google Scholar 

  4. Bousquet-Mélou, M.: New enumerative results on two-dimensional directed animals. Discrete Math. 180(1–3), 73–106 (1998)

    Article  MathSciNet  Google Scholar 

  5. Bousquet-Mélou, M., Fédou, J.M.: The generating function of convex polyominoes: the resolution of a \(q\)-differential system. Discrete Math. 137(1–3), 53–75 (1995)

    Article  MathSciNet  Google Scholar 

  6. Broadbent, S., Hammersley, J.: Percolation processes: I. Crystals and mazes. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 53, pp. 629–641. Cambridge University Press (1957)

    Article  MathSciNet  Google Scholar 

  7. Delest, M.P.: Generating functions for column-convex polyominoes. J. Comb. Theory Ser. A 48(1), 12–31 (1988)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Jensen, I., Guttmann, A.: Statistics of lattice animals (polyominoes) and polygons. J. Phys. A: Math. Gen. 33(29), L257 (2000)

    Article  MathSciNet  Google Scholar 

  10. Klarner, D.: Cell growth problems. Can. J. Math. 19, 851–863 (1967)

    Article  MathSciNet  Google Scholar 

  11. Klarner, D., Rivest, R.: A procedure for improving the upper bound for the number of n-ominoes. Can. J. Math. 25(3), 585–602 (1973)

    Article  MathSciNet  Google Scholar 

  12. Ranjan, D., Zubair, M.: Vertex isoperimetric parameter of a computation graph. Int. J. Found. Comput. Sci. 23(04), 941–964 (2012)

    Article  MathSciNet  Google Scholar 

  13. Sieben, N.: Polyominoes with minimum site-perimeter and full set achievement games. Eur. J. Comb. 29(1), 108–117 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Graphics and Geometric Computing, Department of Computer Science, Technion—Israel Institute of Technology, 3200003, Haifa, Israel

    Gill Barequet & Gil Ben-Shachar

Authors
  1. Gill Barequet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gil Ben-Shachar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gill Barequet .

Editor information

Editors and Affiliations

  1. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

  2. Shandong University, Jinan, China

    Daming Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Barequet, G., Ben-Shachar, G. (2018). Properties of Minimal-Perimeter Polyominoes. In: Wang, L., Zhu, D. (eds) Computing and Combinatorics. COCOON 2018. Lecture Notes in Computer Science(), vol 10976. Springer, Cham. https://doi.org/10.1007/978-3-319-94776-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94776-1_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94775-4

  • Online ISBN: 978-3-319-94776-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation