Summary

• Page properties (2 modified, 0 added, 0 removed)

Details

Page properties

Author

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

Content

...	...	@@ -1,4 +1,4 @@
1		-{{panel title="Project Overview"}}
	1	+== Project Overview ==
2	2	Related Theses:
3	3
4	4	* 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"]])
...	...	@@ -5,8 +5,8 @@
5	5	* 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);" %)
6	6
7	7	* 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"]])
8		-{{/panel}}
9	9
	9	+
10	10	KLay Planar encompasses planarization based layout algorithms. The main approach employed here is the //topology-shape-metrics// approach, which consists of the following phases:
11	11
12	12	1. Planar subgraph - Remove edges until the resulting subgraph is planar. The goal is to minimize the number of removed edges.