Opened Access An aperiodic tiles machine
Cites

Show item statistics
Icon
Export to
Author: Cáceres González, José
Márquez Pérez, Alberto
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2002
Published in: Computational Geometry, 23 (2), 171-182.
Document type: Article
Abstract: 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.
Cite: Cáceres González, J. y Márquez Pérez, A. (2002). An aperiodic tiles machine. Computational Geometry, 23, 171-182.
Size: 309.8Kb
Format: PDF

URI: http://hdl.handle.net/11441/34382

DOI: http://dx.doi.org/10.1016/S0925-7721(01)00060-8

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)