| ... |
... |
@@ -107,6 +107,7 @@ |
| 107 |
107 |
Implementations |
| 108 |
108 |
)))|((( |
| 109 |
109 |
* {{code language="none"}}LayerSweepCrossingMinmizer{{/code}}. Does several sweeps across the layers, minimizing the crossings between each pair of layers using a barycenter heuristic. Supports node successor constraints and layout groups. Node successor constraints require one node to appear before another node. Layout groups specify sets of nodes whose nodes must not be interleaved. See [[this page>>doc:Layer Sweep Crossing Minimization]] for more information. |
|
110 |
+* {{code language="none"}}InteractiveCrossingMinimizer.{{/code}} Detects the order of nodes according to the current layout, hence it reacts to the user's placement. |
| 110 |
110 |
))) |
| 111 |
111 |
|
| 112 |
112 |
== Phase 4: Node Placement == |
| ... |
... |
@@ -149,7 +149,7 @@ |
| 149 |
149 |
** ((( |
| 150 |
150 |
Georg Sander, A fast heuristic for hierarchical Manhattan layout. In //Proceedings of the Symposium on Graph Drawing (GD'95)//, LNCS vol. 1027, pp. 447-458, Springer, 1996. |
| 151 |
151 |
))) |
| 152 |
|
-* {{code language="none"}}BKNodePlacer.{{/code}} ??? Inspired by\\ |
|
153 |
+* {{code language="none"}}BKNodePlacer.{{/code}} Assembles nodes into blocks placed in straight lines in an attempt to minimize the number of edge bends, similar to the linear segments node placer. However, instead of using a barycenter heuristic to place nodes, the placement also tries to minimize the number of edge bends, usually resulting in diagrams that require more space.\\ |
| 153 |
153 |
** ((( |
| 154 |
154 |
Ulrik Brandes and Boris Köpf, Fast and simple horizontal coordinate assignment. In //Proceedings of the 9th International Symposium on Graph Drawing (GD'01)//, LNCS vol. 2265, pp. 33-36, Springer, 2002. |
| 155 |
155 |
))) |