Orientador : Nelson Castro Machado / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Ciencia da Computação / Made available in DSpace on 2018-07-15T07:02:45Z (GMT). No. of bitstreams: 1 Liesenberg_HansKurtEdmund_M.pdf: 3279977 bytes, checksum: fec82be433aa5cd217e5e8df9ee9ef00 (MD5) Previous issue date: 1980 / Resumo: Não informado / Abstract: This paper presents a routing algorithm for printed circuit boards whose input is a description of the relative position of the components instead of the specific location of each component. Using two-layer boards with non-fixed dimensions the algorithm always defines all the desired connections. It is al so able to accept any component whose pins are on the boundary of a rectangle. The algorithm is non-cellular the connections are stablished macroscopically on a grid with a small number of rows and columns, where each component corresponds to an intersection. This approach yields great savings in memory space and computing time. The spacing between components is initially assumed unlimited, capable of supporting any number of connections. The actual number of connections in the macroscopic cells is determined by the algorithm and only then the final location of each component is established thus defining the dimensions of the board / Mestrado / Mestre em Ciência da Computação