Welcome to my collection of n-uniform tilings!

Prior to my research in the area of n-uniform tilings, no complete sets of n-uniform tilings had ever been enumerated for any n>3. I have long been fascinated by these kinds of tilings, and after a great deal of effort, I was able to write a computer program that automatically generates complete sets of tilings for a given n. It took approximately one month of computation time to generate the 6-uniform tilings. The program is also able to generate, in considerably less time, sets of m-Archimedean, n-uniform tilings, where m is close to n. This capability was used to reproduce the results of Otto Krotenheerdt and to generate his tilings (where m=n).

Copyright 2002-2017 Brian Galebach