Automatic building of graphs for rectangular dualisation

Authors:
Marwan A. Jabri
Affiliations:
Laboratory for Imaging Science and Engineering, School of Electrical Engineering, University of Sydney, New South Wales 2006, Australia
Venue:
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Year:
1988

Citing 6
Cited 2

A linear algorithm to find a rectangular dual of a planar triangulated graph

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Efficient Planarity Testing

Journal of the ACM (JACM)
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits.

DAC '84 Proceedings of the 21st Design Automation Conference
The planar package planner for system designers

DAC '82 Proceedings of the 19th Design Automation Conference
Automatic floorplan design

DAC '82 Proceedings of the 19th Design Automation Conference
On finding most optimal rectangular package plans

DAC '82 Proceedings of the 19th Design Automation Conference

PIAF: a knowledge-based/algorithm top-down floorplanning system

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
PIAF: Efficient IC Floor Planning

IEEE Expert: Intelligent Systems and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rectangular dualisation is a technique used to generate rectangular topologies for use in top-down floorplanning of integrated circuits. This paper presents an efficient algorithm that transforms an arbitrary graph, representing a custom integrated circuit, into one suitable for rectangular dualisation. The algorithm makes use of efficient techniques in graph processing such as planar embedding and introduces a novel procedure to transform a tree of biconnected sub-graphs into a block neighbourhood graph that is a path.