Algorithmic aspects of plan generation and enumeration

Plans composed from elements of rectangular grids are considered. A general approach towards the generation and enumeration of nonequivalent plans is presented. It is shown that for these plans there is a minimum colouring which permits easy detection of isomorphs without the need for external storage devices. The notions of threading patterns and colour rules are introduced. Four specific algorithms for different types of plans involving rectangular elements are developed.