tile - Tiling Problem - - If sub-windows of a computer...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 Tiling Problem ------ ------- If sub-windows of a computer screen window are not sup- posed to overlap, determining the placement of these sub-windows can be difficult. This problem addresses a simple case of non-overlapping sub-window placement. We will call the sub-windows `tiles', and abstract the problem by considering windows and tiles to be squares of characters. Thus saying that a window (or tile) has size N means the window (or tile) consists of NxN characters. The problem is, given a window of size N, and tiles named A, B, C, . .. of sizes sA, sB, sC, . .., place the tiles in the window. The position of a tile is its upper left corner. The window is blank before any tile is placed, meaning that all its characters are the space character. When a tile is placed, its name, which is a single character, is copied into all the window charac- ters occupied by the tile. In this problem tiles are placed in order of their name, and a strict left-to-right top-to-bottom scan is
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/29/2011 for the course IT 201 taught by Professor K.v.arya during the Spring '11 term at IIT Kanpur.

Page1 / 3

tile - Tiling Problem - - If sub-windows of a computer...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online