Drawing Permutations with Few Corners
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is decomposed into nearest-neighbour transpositions. We address the problem of minimizing the number of crossings together with the number of corners of the paths, focusing on classes of permutations in which both can be minimized simultaneously. We give algorithms for computing such tangles for several classes of permutations.
KeywordsMinimal Pair Identity Permutation Sorting Network Integrate Circuit Design Vertical Path
- 5.Bereg, S., Holroyd, A.E., Nachmanson, L., Pupyrev, S.: Drawing permutations with few corners. ArXiv e-print abs/1306.4048 (2013)Google Scholar
- 8.Knuth, D.: The art of computer programming. Addison-Wesley (1973)Google Scholar
- 10.Pupyrev, S., Nachmanson, L., Bereg, S., Holroyd, A.E.: Edge routing with ordered bundles. In: van Kreveld, M.J., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 136–147. Springer, Heidelberg (2012)Google Scholar
- 12.Wang, D.C.: Novel routing schemes for IC layout, part I: Two-layer channel routing. In: 28th ACM/IEEE Design Automation Conference, pp. 49–53 (1991)Google Scholar