A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On identification in Z(2) using translates of given patterns
Tekijät: Honkala I, Lobstein A
Kustantaja: GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM
Julkaisuvuosi: 2003
Journal: Journal of Universal Computer Science
Tietokannassa oleva lehden nimi: JOURNAL OF UNIVERSAL COMPUTER SCIENCE
Lehden akronyymi: J UNIVERS COMPUT SCI
Vuosikerta: 9
Numero: 10
Aloitussivu: 1204
Lopetussivu: 1219
Sivujen määrä: 16
ISSN: 0948-695X
Tiivistelmä
Given a finite set of patterns, i.e., subsets of Z(2). What is the best way to place translates of them in such a way that every point belongs to at least one translate and no two points belong to the same set of translates? We give some general results, and investigate the particular case when there is only a single pattern and that pattern is a square or has size at most four.
Given a finite set of patterns, i.e., subsets of Z(2). What is the best way to place translates of them in such a way that every point belongs to at least one translate and no two points belong to the same set of translates? We give some general results, and investigate the particular case when there is only a single pattern and that pattern is a square or has size at most four.
Turun yliopiston Tutkimustietojärjestelmän portaali