Date: Fri, 13 Dec 2019 09:13:37 +0000 (UTC) Message-ID: <159662922.7.1576228417744@80eeb993bdea> Subject: Exported From Confluence MIME-Version: 1.0 Content-Type: multipart/related; boundary="----=_Part_6_1148411561.1576228417743" ------=_Part_6_1148411561.1576228417743 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Content-Location: file:///C:/exported.html KLay Planar

# KLay Planar

Project Overview
=20

Related Theses:

• Ole Clau=C3=9Fen, Implementing an algorithm for orthogonal graph la= yout, September 2010 (pdf)
• Christian Kutschmar, Planarisierung von Hypergraphen, Septembe= r 2010 (pdf)
• Paul Klose, A generic framework for topology-shape-metrics-bas= ed layout, October 2012 (pdf)
=20

KLay Planar encompasses planarization based layout algorithms. The main = approach employed here is the topology-shape-metrics approach, whi= ch consists of the following phases:

1. Planar subgraph - Remove edges until the resulting subgraph is planar. = The goal is to minimize the number of removed edges.
2. Edge insertion - Reinsert the previously removed edges and replace all = resulting crossings by new dummy nodes. The result is a planar embedding (<= em>topology). The goal is to minimize the number of introduced dummy n= odes.
3. 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.
4. Compaction - Determine specific coordinates for nodes and edge bend poi= nts (metrics). The goal is to minimize the length of edge segments= .

The implementation is currently in progress...

------=_Part_6_1148411561.1576228417743--