论文信息 - A Data Structure for Gridless Routing

A Data Structure for Gridless Routing

A new data structure suitable for the implementation of gridless routing algorithms is presented. The data structure and sime basic access procedures are outlined in PASCAL and experimental results are given to demonstrate the performance of retrieval algorithms working on the structure.

Ulrich Lauther | U. Lauther

[1] Dave Hightower. A solution to line-routing problems on the continuous plane , 1969, DAC '69.

[2] Akihiro Hashimoto,et al. Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[3] Roland L. Mattison. A high quality, low cost router for MOS/LSI , 1972, DAC '72.

[4] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.

[5] Robert J. Smith,et al. A rectangle-probe router for multilayer P.C. boards* , 1977, DAC '77.

[6] Ivan Dobes. A multi-contouring algorithm , 1977, SIGD.

[7] Ulrich Lauther,et al. The siemens-avesta-system for computer-aided design of MOS-standard cell circuits , 1977, DAC '77.

[8] William M. van Cleemput,et al. Implementation of an Interactive Printed Circuit Design System , 1978, 15th Design Automation Conference.

[9] Jon Louis Bentley,et al. Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.

[10] A min-cut placement algorithm for general cell assemblies based on a graph representation , 1979, DAC '79.