4.4 basic data structures.pptxVIP

4.4 Basic Data Structures Lixi 2012.10.22 1 A layout can be represented easily if partitioned into a collection of tiles. A tile is a rectangular section of the layout within a single layer. The tiles are not allowed to overlap within a layer. The elements of a layout are referred to as block tiles. For ease of presentation, we will refer to a block tile simply as a block. The area within a layout that does not contain a block is referred to as vacant space. 2 4.4.1 Atomic Operations for Layout Editors The basic set of operations that give a designer the freedom to fully manipulate a layout, is referred to as the Atomic Operations. The following is the list of atomic operations that a layout editor must support. P=(x , y) 3 Given block B 4 (x , y) L w A B 5 (x , y) L w A 6 B B 7 B B 8 A A d 9 A A 1-dimensional compaction 2-dimensional compaction 10 A Vacant space 11 4.4.2 Linked List of Blocks The simplest data structure used to store the components of a layout is a linked list, where each node in the list represents a block. 12 13 Linked list data structures are suitable for a hierarchical system since each level of hierarchy contains few blocks. However, this data structure is not suitable for non hierarchical systems and for hierarchical systems with a large number of blocks in each level. The major disadvantage of this structure is that it does not explicitly represent the vacant space. 14 Converting the vacant space into a collection vacant tiles can be done by extending the upper and lower boundaries of each block horizontally to the left and to the right until it encounters another block or the boundary of the layout as shown in figure 4.19. 15 maximal horizontal strips modified linked list 4.4.3 Bin-Based Method The bin-based data structure does not keep information pertaining to the vacant space and does not create vacant tiles. The grid divides the area into a series of bins which can be represented using a two-dimensional arra