Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
An efficient implementation of sugiyama's algorithm for layered graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
Layer-free upward crossing minimization
Journal of Experimental Algorithmics (JEA)
GD'06 Proceedings of the 14th international conference on Graph drawing
| Hi-index | 0.00 |
In a mixed upward drawing of a graph G = (V,E) all directed edges ED⊆E are represented by monotonically increasing curves. Mixed upward drawings arise in applications like UML diagrams where such edges denote a hierarchical structure. The mixed upward planarization is an important subtask for computing such drawings. We outline a fast and simple heuristic approach that provides a good quality and can be applied to larger graphs as before in reasonable time. Unlike other Sugiyama-style [4] approaches, the quality is comparable to the GT based approach [2] even if there are only few directed edges. Furthermore, the new approach is particularly suitable for extensions like clustering and swimlanes.