Drawing Permutations with Few Corners
- Cite this paper as:
- Bereg S., Holroyd A.E., Nachmanson L., Pupyrev S. (2013) Drawing Permutations with Few Corners. In: Wismath S., Wolff A. (eds) Graph Drawing. GD 2013. Lecture Notes in Computer Science, vol 8242. Springer, Cham
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.
Unable to display preview. Download preview PDF.