Wiki source code of 2025/26 Orthogonal Layout Project
Last modified by Soeren Domroes on 2025/10/06 10:05
Show last authors
| author | version | line-number | content |
|---|---|---|---|
| 1 | # Inf-MP-ES: Masterprojekt Echtzeitsysteme/Eingebettete Systeme (Layout) | ||
| 2 | |||
| 3 | ## Welcome! | ||
| 4 | |||
| 5 | Welcome to the Wiki page of the Master project offered by the Real Time and Embedded Systems group on orthogonal layout. | ||
| 6 | |||
| 7 | * We give you some insight about what the project is about. | ||
| 8 | * It's the place where we post important information on the project, such as due dates and similar information. | ||
| 9 | * And finally, it's the place where each group will document their project. | ||
| 10 | |||
| 11 | ## About the Orthogonal Layout and the Topology Shape Metrics Approach | ||
| 12 | |||
| 13 | The topology shape metrics approach follows three steps: | ||
| 14 | |||
| 15 | * Topology: Making sure that the order of edges around a node is good and therefore the topology of the graph is good | ||
| 16 | * This should consider potential constraints ports might have and nodes might need, such as the [port constraints supported by ELK](https://eclipse.dev/elk/reference/options/org-eclipse-elk-portConstraints.html), since this might be required for visualizing bus routes. | ||
| 17 | * Other idea: Do octagonal layout or hexagonal layouts meaning that we do not have 4 sides of a node but 8 or 6. | ||
| 18 | * Shape: Make sure that we have minimal edge bends, i.e. the drawing has a nice shape | ||
| 19 | * Metrics: Assign real coordinates to nodes and routes to edges, e.g. on a grid or following other constraints | ||
| 20 | |||
| 21 | ## Topics for this Master's Project | ||
| 22 | |||
| 23 | In this Master's project, we want you to bring your expertise as a computer scientist interested in algorithm engineering or person interested in visualization to tackle the following tasks: | ||
| 24 | |||
| 25 | * Create an algorithm for orthogonal layout using as part of the [Eclipse Layout Kernel](https://eclipse.dev/elk/) | ||
| 26 | * Visualize all bus routes in Kiel using the orthogonal layout algorithm. | ||
| 27 | * Use test-driven development to ensure functionality | ||
| 28 | |||
| 29 | ## Contact us: | ||
| 30 | |||
| 31 | The project is supervised by the following university staff. Please contact us if you have questions regarding the project. | ||
| 32 | |||
| 33 | Prof. Dr. Reinhard von Hanxleden (rvh@informatik...) | ||
| 34 | Maximilian Kasperowski (mka@informatik...) | ||
| 35 | Sören Domrös (sdo@informatik...) | ||
| 36 | |||
| 37 | ## Important dates: | ||
| 38 | |||
| 39 | Kick-Off Meeting: Date 22.10.25 Time 14:15 Location CAP 4 R.1115 | ||
| 40 | |||
| 41 | | Date | | | ||
| 42 | | ---------- | --------------------------------- | | ||
| 43 | | 22.10.2025 | Kick-Off Meeting in CAP 4 R. 1115 | | ||
| 44 | | TBD | First intermediate Presentation | | ||
| 45 | | TBD | Second intermediate Presentation | | ||
| 46 | | TBD | Final Presentation | | ||
| 47 | |||
| 48 | ## Examples: | ||
| 49 | |||
| 50 | See what [yworks has to offer](https://www.yfiles.com/demos?search=orthogo&demo=layout-styles-orthogonal). | ||
| 51 | |||
| 52 | Get inspired by the map of KVG bus lines. | ||
| 53 | |||
| 54 |  | ||
| 55 | |||
| 56 | ## Literature | ||
| 57 | |||
| 58 | * Implementing an Algorithm for Orthogonal Graph Layout (Bachelor Thesis), [https://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/theses/ocl-bt.pdf](https://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/theses/ocl-bt.pdf) | ||
| 59 | * A Generic Framework for Topology-Shape-Metrics-Based Layout, [https://rtsys.informatik.uni-kiel.de/~biblio/downloads/theses/pkl-mt.pdf](https://rtsys.informatik.uni-kiel.de/~biblio/downloads/theses/pkl-mt.pdf) | ||
| 60 | * A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagrams, [https://dl.acm.org/doi/pdf/10.1145/774833.774860](https://dl.acm.org/doi/pdf/10.1145/774833.774860) | ||
| 61 | * HOLA: Human-like Orthogonal Network Layout, [https://ieeexplore.ieee.org/abstract/document/7192690](https://ieeexplore.ieee.org/abstract/document/7192690) | ||
| 62 | * Orthogonal graph drawing with constraints: algorithms and applications, [https://bibliographie.uni-tuebingen.de/xmlui/bitstream/handle/10900/49366/pdf/diss.pdf;sequence=1](https://bibliographie.uni-tuebingen.de/xmlui/bitstream/handle/10900/49366/pdf/diss.pdf;sequence=1) | ||
| 63 | * Non-planar Orthogonal Drawings with Fixed Topology, [https://link.springer.com/chapter/10.1007/978-3-540-30577-4_13](https://link.springer.com/chapter/10.1007/978-3-540-30577-4_13) | ||
| 64 | * yFiles Orthogonal Layout, [https://docs.yworks.com/yfilesjavafx/doc/api/#/dguide/orthogonal_layout](https://docs.yworks.com/yfilesjavafx/doc/api/#/dguide/orthogonal_layout) | ||
| 65 | * The Open Graph Drawing Framework (OGDF), (see [https://ogdf.uos.de/),](https://ogdf.uos.de/)[https://ogdf.uos.de/wp-content/uploads/2019/04/ogdf.pdf](https://ogdf.uos.de/wp-content/uploads/2019/04/ogdf.pdf) | ||
| 66 | |||
| 67 | ### Metro Line Layout | ||
| 68 | |||
| 69 | * Automatic Metro Map Layout Using Multicriteria Optimization, [https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5406516](https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5406516) | ||
| 70 | |||
| 71 | ### Port Constraints | ||
| 72 | |||
| 73 | * Drawing layered graphs with port constraints [https://www.sciencedirect.com/science/article/pii/S1045926X13000943](https://www.sciencedirect.com/science/article/pii/S1045926X13000943) | ||
| 74 | * Layered drawing of undirected graphs with generalized port constraints, [https://www.sciencedirect.com/science/article/pii/S0925772122000293](https://www.sciencedirect.com/science/article/pii/S0925772122000293) | ||
| 75 | * Orthogonal Graph Drawing with Constraints, [https://dl.acm.org/doi/pdf/10.5555/338219.338225](https://dl.acm.org/doi/pdf/10.5555/338219.338225) |