Skip to Content

Changes for page KLay Layered

Last modified by Richard Kreissig on 2023/09/14 10:18
From version 22.1
edited by msp
on 2014/07/15 01:58
Change comment: There is no comment for this version
To version 24.1
edited by uru
on 2015/03/12 15:33
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.msp
1 +XWiki.uru
Content
... ... @@ -1,13 +1,16 @@
1 1  {{panel title="Project Overview" borderStyle="dashed"}}
2 2  Responsible:
3 3  
4 -* {{mention reference="XWiki.cds" style="FULL_NAME" anchor="XWiki-cds-wVPxS"/}}
4 +* {{mention reference="XWiki.cds" style="FULL_NAME" anchor="XWiki-cds-WDonl"/}}
5 5  
6 -Related Publications:
6 +Key Publications:
7 7  
8 +* Christoph Daniel Schulze, Miro Spönemann, and Reinhard von Hanxleden. Drawing layered graphs with port constraints. //Journal of Visual Languages and Computing, Special Issue on on Diagram Aesthetics and Layout//, 25(2):89–106, 2014. The original publication is available at [[www.sciencedirect.com>>url:http://www.sciencedirect.com/||shape="rect"]]. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/papers/jvlc13.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/cgi-bin/bibcgi.cgi?key=SchulzeSvH14||shape="rect"]])
9 +
10 +Further Publications:
11 +
8 8  * Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, and Petra Mutzel. Port constraints in hierarchical layout of data flow diagrams. In //Proceedings of the 17th International Symposium on Graph Drawing// (GD’09), volume 5849 of LNCS, pages 135–146, Springer, 2010. The original publication is available at [[link.springer.com>>url:http://link.springer.com/||shape="rect"]]. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/papers/gd09.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/cgi-bin/bibcgi.cgi?key=SpoenemannFvH+09||shape="rect"]])
9 9  * Lars Kristian Klauske, Christoph Daniel Schulze, Miro Spönemann, and Reinhard von Hanxleden. Improved layout for data flow diagrams with port constraints. In //Proceedings of the 7th International Conference on Diagrammatic Representation and Inference// (DIAGRAMS’12), volume 7352 of LNAI, pages 65–79, Springer, 2012. The original publication is available at [[link.springer.com>>url:http://link.springer.com/||shape="rect"]]. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/papers/diagrams12b.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/cgi-bin/bibcgi.cgi?key=KlauskeSS+12||shape="rect"]])
10 -* Christoph Daniel Schulze, Miro Spönemann, and Reinhard von Hanxleden. Drawing layered graphs with port constraints. //Journal of Visual Languages and Computing, Special Issue on on Diagram Aesthetics and Layout//, 25(2):89–106, 2014. The original publication is available at [[www.sciencedirect.com>>url:http://www.sciencedirect.com/||shape="rect"]]. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/downloads/papers/jvlc13.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/cgi-bin/bibcgi.cgi?key=SchulzeSvH14||shape="rect"]])
11 11  * Miro Spönemann, Christoph Daniel Schulze, Ulf Rüegg, and Reinhard von Hanxleden. Drawing layered hypergraphs. Technical Report 1404, Christian-Albrechts-Universität zu Kiel, Department of Computer Science, April 2014. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/downloads/papers/report-1404.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/cgi-bin/bibcgi.cgi?key=SpoenemannSRvH14b||shape="rect"]])
12 12  
13 13  Related Theses:
... ... @@ -97,4 +97,20 @@
97 97  1. With a layout computed for each connected component, the ComponentsProcessor is invoked again to join them together. The processor can use one of two implementations of the AbstractGraphPlacer class: SimpleRowGraphPlacer simply places the connected components in rows, trying to adhere to the required aspect ratio. The ComponentGroupGraphPlacer is more sophisticated and tries to work around problems with connected components processing in compound nodes.
98 98  1. Finally, it again uses one of the IGraphImporter implementations to apply the computed layout back to the KGraph.
99 99  
100 -
103 += Example Layouts =
104 +
105 +Below some example diagrams that were layouted with the KLay Layered algorithm.
106 +
107 +== Ptolemy Diagram ==
108 +
109 +[[image:attach:ptolemy.png]]
110 +
111 +== SCChart with Dataflow ==
112 +
113 +(% style="text-align: left;" %)
114 +[[image:attach:scchartsdataflow.png]]
115 +
116 +(% style="text-align: left;" %)
117 +== SCG ==
118 +
119 +[[image:attach:scg.png]]
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -10158118
1 +10751773
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/10158118/KLay Layered
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/10751773/KLay Layered