A multi-layer gridless area routing algorithm based on non-uniform-grid graph

A non-uniform-grid graph model is introduced and a self-adaptive iterative algorithm is presented for multi-layer gridless area routing. Not only can the algorithm handle the case in which the number of metal layers is uncertain, but it can also greatly reduce the search space of multi-layer maze routing by converting multi-layer into multiple two-layer pairs. For a multi-terminal net, the paper introduces a minimum Steiner tree method based on a maximum dominant point concept to disassemble it into several two-terminal nets.