Wiki source code of 2016/17 Real Time Project Layout
Last modified by Richard Kreissig on 2025/01/30 12:15
Hide last authors
| author | version | line-number | content |
|---|---|---|---|
 |
4.1 | 1 | This project is offered as [[MSP1101: Masterprojekt - Echtzeitsysteme/Eingebettete Systeme (Layout) (080098)>>url:http://univis.uni-kiel.de/prg?show=llong&key=16/lectures/2016w:techn/infor/inform/echtze/prakte||shape="rect"]].** **Master students may subsequently write a thesis building on results of the project. |
| 2 | |||
| |
9.1 | 3 | {{info title=" |
| 4 | Kick-Off Meeting"}} | ||
| |
5.1 | 5 | If you would like to join this project, you need to attend the kick-off meeting on **October 26th at 10:00am**. The meeting will be held in CAP4, room 1115. |
| |
8.1 | 6 | {{/info}} |
| |
1.1 | 7 | |
| |
3.1 | 8 | = [[Layout Project>>doc:RTProjectSS15.Layout Project||shape="rect"]] = |
| |
1.1 | 9 | |
| |
3.1 | 10 | Graph layout algorithms are widely used to have computers generate visualizations of graph-like information. To that end, a graph layout algorithm generates a two-dimensional layout that consists of positioning data for nodes (represented as closed shapes) and routing data for edges (represented as curves). There are several approaches for designing graph layout algorithms [1,2]. |
| |
1.1 | 11 | |
| |
3.1 | 12 | As a participant of this practical, you will work together with other students in order to extend specific layout algorithms or design visualizations using the Java programming language. |
| |
1.1 | 13 | |
| |
3.1 | 14 | The algorithms will be implemented according to the layout interface of the [[ELK >>url:https://www.eclipse.org/elk/||shape="rect"]]and [[KIELER >>doc:KIELER.Home||shape="rect"]]projects, which is based on the Eclipse platform. The results may be published as part of either of the two open source projects. |
| |
1.1 | 15 | |
| |
3.1 | 16 | (% style="text-align: center;" %) |
| 17 | (% class="confluence-embedded-file-wrapper confluence-embedded-manual-size" %)[[image:attach:KLighD-CircuitDiagrams.png]] | ||
| |
1.1 | 18 | |
| |
3.1 | 19 | (% style="text-align: center;" %) |
| 20 | //This is KLighD showing a graphical view of a textually specified electric circuit.// | ||
| 21 | |||
| |
1.1 | 22 | |
| |
3.1 | 23 | (% style="text-align: center;" %) |
| 24 | (% class="confluence-embedded-file-wrapper confluence-embedded-manual-size" %)[[image:attach:droprequest1_klay.png]] | ||
| |
1.1 | 25 | |
| |
3.1 | 26 | (% style="text-align: center;" %) |
| |
6.1 | 27 | //A diagram laid out with our ELK Layered algorithm.// |
| |
1.1 | 28 | |
| |
3.1 | 29 | (% style="text-align: center;" %) |
| |
9.1 | 30 | [[image:/bin/download/Projects/Real%20Time%20Project%20WS%201617%20%28Layout%29/WebHome/image2016-8-3%2014%3A42%3A22.png?rev=1.2||alt="image2016-8-3 14:42:22.png"]][[image:/bin/download/Projects/Real%20Time%20Project%20WS%201617%20%28Layout%29/WebHome/image2016-8-3%2014%3A42%3A22.png?rev=1.2||alt="image2016-8-3 14:42:22.png"]]//[[image:attach:image2016-8-3 14:42:22.png]]// |
| |
1.1 | 31 | |
| |
3.1 | 32 | (% style="text-align: center;" %) |
| |
8.1 | 33 | //A visualization of a Ptolemy diagram's hierarchy.// |
| |
1.1 | 34 | |
| |
3.1 | 35 | Responsible for this project is [[Ulf>>mailto:msp@informatik.uni-kiel.de||rel="nofollow" shape="rect" class="external-link"]][[ Rüegg>>mailto:uru@informatik.uni-kiel.de||rel="nofollow" shape="rect" class="external-link"]]. If you need assistance, feel free to send an email or ask for an appointment. |
| |
1.1 | 36 | |
| |
3.1 | 37 | === References === |
| |
1.1 | 38 | |
| |
3.1 | 39 | [1] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1998. |
| 40 | [2] Tamassia, Roberto. Handbook of graph drawing and visualization. Chapman and Hall/CRC, 2013. (Online: [[https:~~/~~/cs.brown.edu/~~~~rt/gdhandbook/>>url:https://cs.brown.edu/%7Ert/gdhandbook/||rel="nofollow" shape="rect" class="external-link"]]) | ||
| 41 | [3] Christoph Daniel Schulze and Miro Spönemann and Reinhard von Hanxleden. Drawing Layered Graphs with Port Constraints. Journal of Visual Languages and Computing, Special Issue on Diagram Aesthetics and Layout, 2014. | ||
| |
1.1 | 42 | |
| |
3.1 | 43 | |
| |
1.1 | 44 | |
| |
3.1 | 45 | |
| |
6.1 | 46 | (% style="display: none;" %) |
| 47 | ((( | ||
| 48 | 318 | ||
| 49 | ))) |