Wiki source code of Node Placement with Flexible Node Size and Port Position
Version 11.1 by Richard Kreissig on 2023/09/07 11:19
Show last authors
| author | version | line-number | content |
|---|---|---|---|
| 1 | |||
| 2 | The classic Sugiyama graph drawing algorithm consists of 5 phases: cycle breaking, layer assignment, crossing minimization, node placement and edge routing. Node placement sets the x-coordinates of nodes (in a downward layout) and creates alignment between nodes, improves edge straightness, or balances nodes based on their incoming edges. Node sizes can also be used to eliminate edge bends by increasing the size of nodes, as seen below, which makes the drawing easier to read, edges easier to follow and therefore easier to understand. | ||
| 3 | |||
| 4 | [[image:attach:jette-stpa-oyes-bad.png]] | ||
| 5 | |||
| 6 | [[image:attach:jette-stpa-oyes.png]] | ||
| 7 | |||
| 8 | Figure showing the current layout without flexible node size and the existing ONO (obviously not optimal) parts of a layout with flexible node size | ||
| 9 | |||
| 10 | = Goals = | ||
| 11 | |||
| 12 | * Improve the existing Network Simplex node placement strategy with flexible node size by:\\ | ||
| 13 | ** centering edges on their nodes if it does not compromise the quality of the layout, if necessary by increasing node sizes even more | ||
| 14 | ** minimize the size of the drawing if possible | ||
| 15 | * (optional) Explore options that need configuration depending on the context. | ||
| 16 | ** alignment of edges, ... | ||
| 17 | |||
| 18 | = Scope = | ||
| 19 | |||
| 20 | Master's (Bachelor's) Thesis | ||
| 21 | |||
| 22 | = Related Work/Literature = | ||
| 23 | |||
| 24 | Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-Phong Vo, //A technique for drawing directed graphs//. Software Engineering 19(3), pp. 214-230, 1993. | ||
| 25 | |||
| 26 | Ulf Rüegg, //Sugiyama Layouts for Prescribed Drawing Areas //([[KCSS>>url:https://www.uni-kiel.de/journals/receive/jportal_jparticle_00000341||shape="rect" class="internal-link"]] 2018/1), Chapter 4.1: Network Simplex Approach | ||
| 27 | |||
| 28 | = Involved Languages/Technologies = | ||
| 29 | |||
| 30 | * Java | ||
| 31 | * ELK | ||
| 32 | ** [[https:~~/~~/github.com/eclipse/elk/issues/853>>url:https://github.com/eclipse/elk/issues/853||shape="rect"]] (corresponding ticket in [[ELK>>url:https://www.eclipse.org/elk/||shape="rect"]]) | ||
| 33 | |||
| 34 | = Supervised By = | ||
| 35 | |||
| 36 | Sören Domrös | ||
| 37 | |||
| 38 | sdo@ifi |