Wiki source code of KLay Planar
Last modified by Richard Kreissig on 2023/09/14 10:23
Show last authors
| author | version | line-number | content |
|---|---|---|---|
| 1 | == Project Overview == | ||
| 2 | Related Theses: | ||
| 3 | |||
| 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 | * 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 | |||
| 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 | |||
| 9 | |||
| 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 | |||
| 12 | 1. Planar subgraph - Remove edges until the resulting subgraph is planar. The goal is to minimize the number of removed edges. | ||
| 13 | 1. Edge insertion - Reinsert the previously removed edges and replace all resulting crossings by new dummy nodes. The result is a planar embedding (//topology//). The goal is to minimize the number of introduced dummy nodes. | ||
| 14 | 1. Orthogonalization - Find an orthogonal form by computing a series left or right bends for each edge (//shape//). The goal is to minimize the number of bends. | ||
| 15 | 1. Compaction - Determine specific coordinates for nodes and edge bend points (//metrics//). The goal is to minimize the length of edge segments. | ||
| 16 | |||
| 17 | The implementation is currently in progress... |