Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
GI '04 Proceedings of the 2004 Graphics Interface Conference
A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry
Graphs and Combinatorics
Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry
Computational Geometry and Graph Theory
The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
Polyiamonds are the two dimensional shapes made by connecting n unit triangles, joined along their edges. In this paper, we propose algorithms to generate polyiamonds for p6 tiling, i.e., those covering the plane by 6-fold rotations around two rotation centers (60 degrees rotations around the origin and 120 degrees rotations around the terminus). Our algorithm is based on the techniques of the reverse search: (1) No trial and error, since we design rules to generate the next. (2) No need to store already generated polyiamonds. According to these good properties and the proposed rule specific to p6 tiling, we have succeeded to generate 137,535 polyiamonds for p6 tiling up to n=25, which include 2,246 polyiamonds up to n=16 obtained by the conventional method.