Abstract
It may be of interest to represent a periodic bitmap pattern, with period vectors that are not horizontal and vertical, using rectangular bitmaps. Holladay's algorithm provides an efficient way to do this when the tiled motif is small, using a single rectangle. We show that this may not be efficient when the repeated motif is larger, and give a generalization, using two rectangles, that requires fewer partial blits.