In this paper a new approach to the placement problem is introduced. The main idea is to take advantage of what one can do in linear placement in tackling the two-dimensional placement problem. The method consists of three distinct phases, namely: decomposition, linear placement, and iterative improvement. Each is clearly spelled out. Both constructive and iterative algorithms are developed. The complexity of computation is analyzed and the method has been tried with practical examples.
|Title of host publication||IEEE Trans Circuits Syst|
|Number of pages||7|
|Publication status||Published - 1978 Apr|
ASJC Scopus subject areas