The (m,k)-patch boundary code problem

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


A simple (non overlapping) region of the hexagonal tessellation of the plane is uniquely determined by its boundary. This seems also to be true for "regions" that curve around and have a simple overlap. However, Guo, Hansen and Zheng [3] constructed a pair of non isomorphic (self-overlapping) regions of the hexagonal tessellation which have the same boundary. These regions overlapped themselvas several times. In this paper we prove that any region not uniquely determined by its boundary must cover some point three or more times.

Original languageEnglish (US)
Pages (from-to)189-196
Number of pages8
Issue number48
StatePublished - 2003

ASJC Scopus subject areas

  • General Chemistry
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'The (m,k)-patch boundary code problem'. Together they form a unique fingerprint.

Cite this