An efficient zero-skew routing algorithm

Masato Edahiro
1994 Proceedings of the 31st annual conference on Design automation conference - DAC '94  
Abstract| A bucket algorithm is proposed for zeroskew routing with linear time complexity on the average. Our algorithm is much simpler and more ecient than the best known algorithm which uses Delaunay triangulations for segments on Manhattan distance. Experimental results show that the linearity of our algorithm is accomplished. Our algorithm generates a zero-skew routing for 3000-pin benchmark data within 5 seconds on a 90MIPS RISC workstation.
doi:10.1145/196244.196426 dblp:conf/dac/Edahiro94 fatcat:k33kxgj7vvgsjkifhxrcnwqbka