Covering by squares

L. Salinas, E. Goles

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva


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.

Idioma originalInglés
Páginas (desde-hasta)10-27
Número de páginas18
PublicaciónTheoretical Computer Science
EstadoPublicada - 10 may. 2008
Publicado de forma externa


Profundice en los temas de investigación de 'Covering by squares'. En conjunto forman una huella única.

Citar esto