Skip to Content

Changes for page The Five Phases

Last modified by Alexander Schulz-Rosengarten on 2023/07/11 10:33
From version 13.1
edited by cds
on 2014/11/23 14:32
Change comment: There is no comment for this version
To version 10.1
edited by cds
on 2013/05/10 15:18
Change comment: There is no comment for this version

Summary

Details

Page properties
Parent
... ... @@ -1,1 +1,0 @@
1 -KLay Layered
Content
... ... @@ -33,13 +33,6 @@
33 33  ** Peter Eades, Xuemin Lin, W. F. Smyth, A fast and effective heuristic for the feedback arc set problem. //Information Processing Letters// 47(6), pp. 319-323, 1993.
34 34  * {{code language="none"}}InteractiveCycleBreaker.{{/code}} Detects feedback edges according to the current layout, hence it reacts to the user's placement.
35 35  )))
36 -|=(% colspan="1" %)(% colspan="1" %)
37 -(((
38 -Tests
39 -)))|(% colspan="1" %)(% colspan="1" %)
40 -(((
41 -* The graph contains no cycles.
42 -)))
43 43  
44 44  == Phase 2: Layering ==
45 45  
... ... @@ -78,16 +78,6 @@
78 78  )))
79 79  * {{code language="none"}}InteractiveLayerer.{{/code}} Detects layers according to the current layout, hence it reacts to the user's placement.
80 80  )))
81 -|=(% colspan="1" %)(% colspan="1" %)
82 -(((
83 -Tests
84 -)))|(% colspan="1" %)(% colspan="1" %)
85 -(((
86 -* The set of layerless nodes is empty.
87 -* For every edge that points from layer {{code language="none"}}i{{/code}} to layer {{code language="none"}}j, i<j{{/code}} holds.
88 -* No empty layer exists.
89 -* All nodes that existed prior to this phase are assigned to a layer.
90 -)))
91 91  
92 92  == Phase 3: Crossing Reduction ==
93 93  
... ... @@ -123,13 +123,6 @@
123 123  * {{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.
124 124  * {{code language="none"}}InteractiveCrossingMinimizer.{{/code}} Detects the order of nodes according to the current layout, hence it reacts to the user's placement.
125 125  )))
126 -|=(% colspan="1" %)(% colspan="1" %)
127 -(((
128 -Tests
129 -)))|(% colspan="1" %)(% colspan="1" %)
130 -(((
131 -* All nodes remain in their respective layer.
132 -)))
133 133  
134 134  == Phase 4: Node Placement ==
135 135  
... ... @@ -174,16 +174,7 @@
174 174  ** (((
175 175  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.
176 176  )))
177 -* {{code language="none"}}InteractiveNodePlacer{{/code}}. Tries to keep the preset coordinates of nodes from the original layout. For dummy nodes, a guess is made to infer their coordinates. Requires the other interactive phase implementations to have run as well.
178 178  )))
179 -|=(% colspan="1" %)(% colspan="1" %)
180 -(((
181 -Tests
182 -)))|(% colspan="1" %)(% colspan="1" %)
183 -(((
184 -* The nodes of a layer are strictly ordered with regards to their y coordinate.
185 -* Any two nodes of a layer do not overlap with regards to their bounding box (height + margins).
186 -)))
187 187  
188 188  == Phase 5: Edge Routing ==
189 189  
... ... @@ -223,10 +223,3 @@
223 223  * {{code language="none"}}PolylineEdgeRouter{{/code}}. Simplest routing style that just inserts bend points at the position of long edge dummy nodes.
224 224  * {{code language="none"}}SplineEdgeRouter{{/code}}. A simple method for routing the edges with splines. Uses the long edge dummy nodes as reference points for spline calculation.
225 225  )))
226 -|=(% colspan="1" %)(% colspan="1" %)
227 -(((
228 -Tests
229 -)))|(% colspan="1" %)(% colspan="1" %)
230 -(((
231 -* {{code language="none"}}OrthogonalEdgeRouter{{/code}}: For any two succeeding bendpoints of an edge either the y coordinates or the x coordinates are the same. Starting with the same x coordinates, alternating equality is required.
232 -)))
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -884883
1 +7111008
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/884883/The Five Phases
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/7111008/The Five Phases