An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits
21st Design Automation Conference ProceedingsPublished 1 January 1984
Krzysztof Koźmiński, E. Kinnen
Citations52
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An O(n /sup 2/) algorithm for finding a rectangular dual of a planar triangulated graph is presented and is useful for solving area planning problems in VLSI IC design.
Abstract
An O(n /sup 2/) algorithm for finding a rectangular dual of a planar triangulated graph is presented. In practice, almost linear running times have been observed. The algorithm is useful for solving area planning problems in VLSI IC design.
Keywords
Computer ScienceEngineering