Wiki source code of Real Time Project WS 16/17 (Layout)
Version 6.3 by uru on 2023/07/19 11:18
Hide last authors
| author | version | line-number | content |
|---|---|---|---|
 |
1.1 | 1 | {{layout}} |
| 2 | {{layout-section ac:type="single"}} | ||
| 3 | {{layout-cell}} | ||
| |
4.1 | 4 | 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. |
| 5 | |||
| 6 | |||
| 7 | |||
| 8 | {{tip title="Kick-Off Meeting"}} | ||
| |
5.1 | 9 | 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. |
| |
1.1 | 10 | {{/tip}} |
| 11 | |||
| |
3.1 | 12 | = [[Layout Project>>doc:RTProjectSS15.Layout Project||shape="rect"]] = |
| |
1.1 | 13 | |
| |
3.1 | 14 | 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 | 15 | |
| |
3.1 | 16 | 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 | 17 | |
| |
3.1 | 18 | 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 | 19 | |
| |
3.1 | 20 | (% style="text-align: center;" %) |
| 21 | (% class="confluence-embedded-file-wrapper confluence-embedded-manual-size" %)[[image:attach:KLighD-CircuitDiagrams.png]] | ||
| |
1.1 | 22 | |
| |
3.1 | 23 | (% style="text-align: center;" %) |
| 24 | //This is KLighD showing a graphical view of a textually specified electric circuit.// | ||
| 25 | |||
| 26 | (% style="text-align: center;" %) | ||
| |
1.1 | 27 | |
| 28 | |||
| |
3.1 | 29 | (% style="text-align: center;" %) |
| 30 | (% class="confluence-embedded-file-wrapper confluence-embedded-manual-size" %)[[image:attach:droprequest1_klay.png]] | ||
| |
1.1 | 31 | |
| |
3.1 | 32 | (% style="text-align: center;" %) |
| |
6.1 | 33 | //A diagram laid out with our ELK Layered algorithm.// |
| |
1.1 | 34 | |
| |
3.1 | 35 | (% style="text-align: center;" %) |
| 36 | //[[image:attach:image2016-8-3 14:42:22.png]]// | ||
| |
1.1 | 37 | |
| |
3.1 | 38 | (% style="text-align: center;" %) |
| 39 | //A visualization of a Ptolemy diagram's hierarchy. | ||
| 40 | // | ||
| |
1.1 | 41 | |
| |
3.1 | 42 | 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 | 43 | |
| |
3.1 | 44 | === References === |
| |
1.1 | 45 | |
| |
3.1 | 46 | [1] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1998. |
| 47 | [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"]]) | ||
| 48 | [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 | 49 | |
| |
4.1 | 50 | |
| |
3.1 | 51 | |
| 52 | |||
| |
1.1 | 53 | {{/layout-cell}} |
| 54 | {{/layout-section}} | ||
| 55 | |||
| |
3.1 | 56 | {{layout-section ac:type="two_equal"}} |
| 57 | {{layout-cell}} | ||
| 58 | |||
| 59 | {{/layout-cell}} | ||
| 60 | |||
| 61 | {{layout-cell}} | ||
| 62 | |||
| 63 | {{/layout-cell}} | ||
| 64 | {{/layout-section}} | ||
| 65 | |||
| |
1.1 | 66 | {{layout-section ac:type="single"}} |
| 67 | {{layout-cell}} | ||
| 68 | |||
| 69 | {{/layout-cell}} | ||
| 70 | {{/layout-section}} | ||
| 71 | {{/layout}} | ||
| |
6.1 | 72 | |
| 73 | (% style="display: none;" %) | ||
| 74 | ((( | ||
| 75 | 318 | ||
| 76 | ))) |