Artículo
An aperiodic tiles machine
Autor/es | Cáceres González, José
Márquez Pérez, Alberto |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2002 |
Fecha de depósito | 2016-02-09 |
Publicado en |
|
Resumen | The results we introduce in this work lead to get an algorithm which produces aperiodic sets of tiles using Voronoi diagrams. This algorithm runs in optimal worst-case time O(nlogn). Since a wide range of new examples can ... The results we introduce in this work lead to get an algorithm which produces aperiodic sets of tiles using Voronoi diagrams. This algorithm runs in optimal worst-case time O(nlogn). Since a wide range of new examples can be obtained, it could shed some new light on non-periodic tilings. These examples are locally isomorphic and exhibit the 5-fold symmetry which appears in Penrose tilings and quasicrystals. Moreover, we outline a similar construction using Delaunay triangulations and propose some related open problems. |
Cita | Cáceres González, J. y Márquez Pérez, A. (2002). An aperiodic tiles machine. Computational Geometry, 23, 171-182. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
An aperiodic tiles.pdf | 309.8Kb | [PDF] | Ver/ | |