| Author | dc.contributor.author | Salinas, L. | |
| Author | dc.contributor.author | Goles Chacc, Eric | es_CL |
| Admission date | dc.date.accessioned | 2010-01-18T14:36:55Z | |
| Available date | dc.date.available | 2010-01-18T14:36:55Z | |
| Publication date | dc.date.issued | 2008-05-10 | |
| Cita de ítem | dc.identifier.citation | THEORETICAL COMPUTER SCIENCE, Volume: 396, Issue: 1-3, Pages: 10-27, 2008 | en_US |
| Identifier | dc.identifier.issn | 0304-3975 | |
| Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/125165 | |
| Abstract | dc.description.abstract | In this paper we introduce the “do not touch” condition for squares in the discrete plane. We say that two squares “do not
touch” if they do not share any vertex or any segment of an edge. Using this condition we define a covering of the discrete plane,
the covering can be strong or weak, regular or non-regular. For simplicity, in this article, we will restrict our attention to regular
coverings, i.e., only a size is allowed for the squares and all the squares have the same number of adjacent squares. We establish
minimal conditions for the existence of a weak or strong regular covering of the discrete plane, and we give a bound for the number
of adjacent squares with respect to the size of the squares in the regular covering. | en_US |
| Patrocinador | dc.description.sponsorship | This work was partially supported by CONICYT scholarship (L.S.), the Centre for Mathematical Modeling (CMM)
(E.G.) and FONDECYT project 1070022 (E.G.). | en_US |
| Lenguage | dc.language.iso | en | en_US |
| Publisher | dc.publisher | ELSEVIER SCIENCE BV | en_US |
| Keywords | dc.subject | Discrete geometry | en_US |
| Título | dc.title | Covering by squares | en_US |
| Document type | dc.type | Artículo de revista | |
