On the Generation and Enumeration of Tessellation Designs

R Krishnamurti and P H O'n Roe
Additional contact information
R Krishnamurti: Centre for Configurational Studies, The Open University, Milton Keynes MK7 6AA, England
P H O'n Roe: Department of Systems Design, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada

Environment and Planning B, 1979, vol. 6, issue 2, 191-260

Abstract: Tessellation designs composed from tiles in periodic space fillings are considered. An efficient algorithmic theory for the generation and enumeration of nonequivalent designs is developed. It is shown that each design has a graphical representation as a labelled subgraph of some graph whose vertices have associated integral coordinates. Detecting isomorphisms between designs then reduces to determining permutations of the labels of the vertices of this graph and may be performed in linear time. A proof of correctness for the algorithmic theory is provided. Nine specific algorithms for various families of designs from the archimedean tessellations are presented.

Date: 1979
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b060191 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:6:y:1979:i:2:p:191-260

DOI: 10.1068/b060191

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().