Generating convex polyominoes at random

@article{Hochstttler1996GeneratingCP,
  title={Generating convex polyominoes at random},
  author={Winfried Hochst{\"a}ttler and Martin Loebl and Christoph Moll},
  journal={Discrete Mathematics},
  year={1996},
  volume={153},
  pages={165-176}
}
We give a new recursion formula for the number of convex polyominoes with fixed perimeter. From this we derive a bijection between an interval of natural numbers and the polyominoes of given perimeter. This provides a possibility to generate such polyominoes at random in polynomial time. Our method also applies for fixed area and even when fixing both, perimeter and area. In the second part of the paper we present a simple linear time probabilistic algorithm which uniformly generates convex… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
15 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

The number of convex polygons on the square and honeycomb lattices

  • A. J. Guttmann
  • J . Phys . A
  • 1989

Polyominoes : a guide to puzzles and problems in tiling ,

  • G. E. Martin
  • Mathematical Association of America Spectrum…
  • 1988

Rigorous results for the number of convex polygons on the square and honeycomb lattices

  • K. Y. Lin, S. J. Chang
  • J . Phys . A
  • 1988

The number of convex polyominos with given perimeter

  • D. Kim
  • Discrete Math
  • 1988

On the number of certain lattice polygons

  • G. P61ya
  • J. Combin. Theory
  • 1969

Similar Papers

Loading similar papers…