Analysis of Data Structures for VLSI Tools.

Date of Submission

December 2009

Date of Award

Winter 12-12-2010

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Sur-Kolay, Susmita (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

An efficient layout data-structure is of great importance to design rule checking algorithms, compaction algorithms, gridless area routing algorithms and many more layout tools. The atomic operations for most of the layout tools are point searching, area searching, neighbour searching, node searching and shadow searching. Nowadays, the trapezoidal corner stitching structure, whose point searching is O(N1/2 ), is the most popular data structure used for the layout tools. The point searching is O(logN) for the other popular tree based data-structures such as KD trees and Quad trees, which is natural due to their construction. But tree based data structures does not provide a fascinating solution to other atomic operations such as area searching and neighbour searching. And the trapezoidal corner stitching structure wins over tree based structures in the area searching and neighbour searching operations. In this thesis, we propose a new data-structure for the atomic operations of layout tools, which combines the trapezoidal corner stitching structure with a KD tree based structure. We call this structure TBT corner stitching (Tree based Trapezoidal corner stitching). The point searching is O(logN), area and neighbour searching is O(n), where N is total number of tiles in the layout and n is the number of tiles intersecting the querry area or the number of neighbouring tiles of the query tiles. We will also compare the complexity of point searching, area searching and neighbour searching algorithms of tree based as well as corner stitch based layout data-structures with our data-structure.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.