EFFICIENT PLANAR EMBEDDING OF TREES FOR VLSI LAYOUTS.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper examines the use of planar polygonal partitioning schemes for embedding tree structures. Two layout designs based on recursive square and triangular decompositions are described for trees having branching factors of k**2 and k**2 minus 1, where k is an integer. The former design allocates the same amount of area to nodes at all levels and requires a total area linear in the number N of nodes in the tree. The latter design assigns increasing area to nodes closer to the root and requires a total area of 0 left bracket N(k**2/k**2 minus 1 logN right bracket . The longest interconnection has a length of 0(Area(N)) in each case.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherIEEE
Pages460-464
Number of pages5
ISBN (Print)0818605456
StatePublished - 1984

Publication series

NameProceedings - International Conference on Pattern Recognition

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'EFFICIENT PLANAR EMBEDDING OF TREES FOR VLSI LAYOUTS.'. Together they form a unique fingerprint.

Cite this