Abstract
The paper describes a method for laying out networks by computer so that the number of crossings between the network connections is close to a minimum. The problem is relevant to the design of printed circuits, where special wiring arrangements have to be made when crossings occur. The network is expressed in the form of a permutation, which is convenient for manipulation, by deforming the network so that the node points lie on a straight line with the connections drawn as semicircles above an below the node line. Locally optimal networks are defined so that no gain can result from moving an individual node to a new position, and a 2-stage method of construction is proposed. The formulas used to calculate the number of crossings consist primarily of summations, so that the procedure is quickly performed on a computer. The method has been tested on some trial networks for which the minimum number of crossings is known, and it has also been compared with Monte Carlo methods on random networks. The results are encouraging in all cases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Institution of Electrical Engineers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
