Project 23:Rectangle placements
Find all possible rectangle placements within an outer-most rectangle. Rectangles are specified on a binary bitmap. The program should work on a specified directory, where each founded image must analyzed individually.
Input:
- On each image there will be exactly one outer-most rectangle, with any number of contained rectangles.
- The contained rectangles can overlap with each other.
- All the contained rectangles are fully within the outer-most rectangle, but the borderlines can overlap.
Output:
- An XML file containing the size of the outer-most rectangle (in pixels) on the current image and the position and size of the contained rectangles on the current image (in pixels). (If it is ambiguous that how the rectangles are on the image, the program should save all the possible placement of the rectangles.)