Skip to Content

Changes for page KLay Force

Last modified by Richard Kreissig on 2023/09/14 10:17
From version 3.1
edited by cds
on 2014/09/29 16:13
Change comment: There is no comment for this version
To version 6.1
edited by Richard Kreissig
on 2023/09/14 10:17
Change comment: There is no comment for this version

Summary

Details

Page properties
Parent
... ... @@ -1,0 +1,1 @@
1 +KIELER.Discontinued Projects.Layout Algorithms (KLay).WebHome
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.cds
1 +XWiki.stu230980
Content
... ... @@ -1,9 +1,10 @@
1 -{{panel title="Project Overview" borderStyle="dashed"}}
1 +Project Overview
2 +
2 2  Responsible:
3 3  
4 4  * Christoph Daniel Schulze
5 -{{/panel}}
6 6  
7 +
7 7  KLay Force is an implementation of the force-based layout approach where edges are regarded as springs pulling together the nodes they connect, while unconnected nodes are pushed apart from one another. The objective is to compute a state where this physical system reaches an equilibrium.
8 8  
9 9  This page describes the available layout options as well as the general architecture of the algorithm.
... ... @@ -14,10 +14,10 @@
14 14  
15 15  {{toc maxLevel="2"/}}
16 16  
17 -[[doc:Downloads - KIELER Layout Algorithms]]
18 +[[doc:KIELER.Downloads - KIELER Layout Algorithms]]
18 18  
19 -{{excerpt-include/}}
20 20  
21 +
21 21  = Layout Options =
22 22  
23 23  {{warning title="ToDo"}}
... ... @@ -26,10 +26,18 @@
26 26  
27 27  = Architecture =
28 28  
30 +The architecture basically consists of two chunks: the graph model and the actual implementation of the algorithm.
31 +
32 +== Graph Model ==
33 +
34 +KLay Force uses a custom, lightweight graph model whose root is the {{code language="none"}}FGraph{{/code}} class. {{code language="none"}}FNode{{/code}} instances are connected through {{code language="none"}}FEdge{{/code}} instances that, to be routed properly, can have {{code language="none"}}FBendpoint{{/code}} instances. Edges and nodes can have a number of {{code language="none"}}FLabel{{/code}} instances. Nodes, labels, and bend points are considered {{code language="none"}}FParticle{{/code}}s since they exert forces on each other. The following is a class diagram of the basic graph model:
35 +
36 +[[image:attach:KLayForce_Model.png]]
37 +
38 +== Algorithm ==
39 +
29 29  {{warning title="ToDo"}}
30 30  Describe architecture.
31 31  {{/warning}}
32 32  
33 -
34 34  
35 -
KLayForce_Model.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +136.4 KB
Content
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9471852
1 +9471847
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9471852/KLay Force
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9471847/KLay Force