EFFICIENT PLANAR EMBEDDING OF TREES FOR VLSI LAYOUTS.

Research output: Contribution to journalArticlepeer-review

Abstract

The use of planar polygonal partitioning schemes for planar embedding of tree structures is examined. Two layout designs based on recursive square and triangular decompositions are described for trees having branching factors of k**2 and k**2-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.

Original languageEnglish (US)
Pages (from-to)189-203
Number of pages15
JournalComputer vision, graphics, and image processing
Volume34
Issue number2
DOIs
StatePublished - 1986

ASJC Scopus subject areas

  • Environmental Science(all)
  • Engineering(all)
  • Earth and Planetary Sciences(all)

Fingerprint

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

Cite this