Optimization for automatic cell assembly

The authors describe an implementation of a cell assembler which automatically decides if the connections between two cells should be made by abutting the cells or by inserting jogged wires. The assembly problem is treated as a two-dimensional river routing problem and is solved by constructing constraint graphs. Experimental results are given which show area reduction due to automatic jogging.<
>