A plaid graph is a graph based on a grid which is missing some regularly spaced series of edges. The parameters defining a plaid graph are a tuple (rows, columns,offset,fill,skip) where each element of the tuple is defined by the following:
rows the number of rows in the underlying grid
columns the number of columns in the underlying grid
offset the number of initial consecutive edges in a row or
column to omit
fill the number of consecutive edges in a row or column which are
included
skip the number of consecutive edges in a row or column which are
skipped
Constructing a Plaid Graph
The graph is constructed by first drawing the points as for a grid of the size specified by row and column. Beginning at the first column count out offset rows to omit. At the next column fill in all vertical edges. Repeat until fill columns have been filled with vertical edges. Skip the next skip column of edges. Repeat the process of filling in fill columns of vertical edges and omitting skip columns of vertical edges until all columns in the graph have been filled or skipped with vertical edges. Beginning at the first row in the graph do the same for every row in the graph. Don't forget to omit the inital offset rows.