4   Artículos

 
en línea
Marcus R. Garvie and John Burkardt    
The general problem of tiling finite regions of the plane with polyominoes is ???? NP -complete, and so the associated computational geometry problem rapidly becomes intractable for large instances. Thus, the need to reduce algorithm complexity for tilin... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Marcus R. Garvie and John Burkardt    
Checkerboard colouring arguments for proving that a given collection of polyominoes cannot tile a finite target region of the plane are well-known and typically applied on a case-by-case basis. In this article, we give a systematic mathematical treatment... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »