Abstract

Representation and traversal of rectangular area graphs is a problem well known in Electronic design\nAutomation (EDA).A new approach to the problem is to use Area trees or A-tree that have quadruple network of area\npointers that can be used to traverse area in any of the four planar directions. The work done in this research enumerates\nthe problems faced while performing basic operations on rectangular areas .We have implemented bisect, sort, merge\nand insert operations in A-tree.