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:

- Planar subgraph - Remove edges until the resulting subgraph is planar. = The goal is to minimize the number of removed edges.
- 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.
- 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. - 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...