Algorithm Design for VLSI Layout

萨拉夫扎德 本论文的研究内容是在四个方面的几何算法的设计工具。 本论文的研究课题是：1. 通过图的二元化进行平面规划; 2. 通过利用电路板布局模块; 3. 直线Steiner树问题;和4. 点优势问题。 在平面规划，拓扑方面的问题被认为是几何问题，如大小进行了探讨。 一个集群技术的模块布局，利用在电路结构中，正在调查。 通过这种方式，可以自动构建反映电路连接的层次视角的自然集群。 正在研究使用斯坦纳树的全局和单层路由的近似设计问题。 点优势，从计算几何，正在应用于电路布局问题。

Sarrafzadeh The research is in four areas of geometric algorithms for design tools. The research topics are: 1. floor planning by graph dualization; 2. placement of modules by exploiting circuit regularities; 3. rectilinear Steiner tree problems; and 4. point dominance problems. In floor-planning, topological aspects of the problem are considered and geometric issues such as sizing are explored. A clustering technique for module placement, that exploits regularities in circuit structures, is being investigated. In this way natural clusters that reflect the hierarchical perspective of circuit connections can be built automatically. Problems in approximate designs for global and single layer routing using Steiner trees are being investigated. Point dominance, from computational geometry, is being applied to circuit layout problems.