Abstract
In thegeneral circular permutation layout problem there are two concentric circles,Cin andCout. There are a set ofn inner terminals onCin and a set ofn outer terminals onCout: terminalsi onCin and π i onCout are to be connected by means of a wire, where 1 ≤i ≤n. All wires must be realized in the interior ofCout. Each wire can intersectCin at most once and at mostK wires, for a fixedK, can pass between two adjacent inner terminals. A linear-time algorithm for obtaining a planar homotopy (single-layer realization) of an arbitrary instance of the general circular permutation layout problem, forK ≥ 0, is proposed. Previously,K = 1 has been studied. In this paper the algorithm is also extended to a more general problem, in which the number of wires allowed to pass between each pair of adjacent terminals onCin may be different from pair to pair.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
