Helly numbers of polyominoes

Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman

Research output: Contribution to conferencePaperpeer-review

Abstract

We define the Helly number of a polyomino P as the smallest number h such that the h-Helly property holds for the family of symmetric and translated copies of P on the integer grid. We prove the following: (i) the only polyominoes with Helly number 2 are the rectangles, (ii) there does not exist any polyomino with Helly number 3, (iii) there exist polyminoes of Helly number k for any k ≠ 1, 3.

Original languageEnglish
Publication statusPublished - 2011 Dec 1
Externally publishedYes
Event23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 - Toronto, ON, Canada
Duration: 2011 Aug 102011 Aug 12

Other

Other23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
CountryCanada
CityToronto, ON
Period11/8/1011/8/12

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Fingerprint Dive into the research topics of 'Helly numbers of polyominoes'. Together they form a unique fingerprint.

Cite this