Summary

• Page properties (3 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Parent

...	...	@@ -1,0 +1,1 @@
	1	+KIELER.Discontinued Projects.Layout Algorithms (KLay).WebHome

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.msp
	1	+XWiki.stu230980

Content

...	...	@@ -1,8 +1,4 @@
1		-{{panel title="Project Overview"}}
2		-Responsible:
3		-
4		-* {{mention reference="XWiki.msp" style="FULL_NAME" anchor="XWiki-msp-ocJLw"/}}
5		-
	1	+== Project Overview ==
6	6	Related Theses:
7	7
8	8	* Ole Claußen, //Implementing an algorithm for orthogonal graph layout//, September 2010 ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/downloads/theses/ocl-bt.pdf||shape="rect"]])
...	...	@@ -9,8 +9,8 @@
9	9	* Christian Kutschmar, //Planarisierung von Hypergraphen//, September 2010 ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/downloads/theses/cku-bt.pdf||shape="rect"]])(% style="color: rgb(0,0,0);" %)
10	10
11	11	* Paul Klose, //A generic framework for topology-shape-metrics-based layout//, October 2012 ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/downloads/theses/pkl-mt.pdf||shape="rect" class="external-link-new-window"]])
12		-{{/panel}}
13	13
	9	+
14	14	KLay Planar encompasses planarization based layout algorithms. The main approach employed here is the //topology-shape-metrics// approach, which consists of the following phases:
15	15
16	16	1. Planar subgraph - Remove edges until the resulting subgraph is planar. The goal is to minimize the number of removed edges.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-8650867
	1	+885070

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/8650867/KLay Planar
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/885070/KLay Planar