David wrote:
Do you have an algorithm as to how to automatically divide an arbitrary rectangle into a near-optimal set of smaller power-of-two rectangles?
For an exact subdivision, decompose each of the coordinates into powers of 2 (which is easy, just look at the bits) and take all the pairwise combinations of widths and heights. You might want to impose some minimum size on the pieces, though, to avoid creating ridiculously small fragments. -- Greg Ewing, Computer Science Dept, +--------------------------------------+ University of Canterbury, | Carpe post meridiem! | Christchurch, New Zealand | (I'm not a morning person.) | [EMAIL PROTECTED] +--------------------------------------+
