Closed jbeard4 closed 9 years ago
We could apply kieler layout to a derived graph: we transform each real transition into a pseudo-node (as big as the label) plus a pair of pseudo-transitions. We then ignore kieler output for transitions, but the positioning of the pseudo-node gives us a reasonable position for the label.
It seems a lot of our layouts result in a stacked pattern like this:
Vertical Stack:
Horizontal Stack:
With some small manual tweaking, we can get this kind of a pattern:
I think this is more aesthetically pleasing because overlapping transitions and transition labels are minimized. We should think about how to optimize edge routing to minimize edge routing.
I have a couple of ideas about how to improve this:
Let's discuss tomorrow.