Wiki source code of Layout Algorithms (KLay)
Version 17.1 by cds on 2014/09/29 16:14
Hide last authors
| author | version | line-number | content |
|---|---|---|---|
 |
14.1 | 1 | |
| |
11.1 | 2 | |
| |
6.1 | 3 | The KLay project encompasses the main layout algorithms developed as part of the KIELER project. It aims at providing Java implementations of different layout algorithms to the [[doc:Infrastructure for Meta Layout (KIML)]]. |
| |
3.1 | 4 | |
| 5 | We currently have the following layout algorithms: | ||
| 6 | |||
| |
17.1 | 7 | * **KLay Force[[doc:KLay Force]]** |
| |
13.1 | 8 | Implementation of approaches based on physical models. |
| |
6.1 | 9 | * **[[doc:KLay Layered]]** |
| |
3.1 | 10 | Implementation of the layer-based "hierarchical" approach by Sugiyama et al. |
| |
10.1 | 11 | * **[[doc:KLay Planar]]** |
| |
3.1 | 12 | Implementation of the planarization-based "topology-shape-metrics" approach. (work in progress) |
| |
16.1 | 13 | * **[[KLay Tree>>doc:KLay Mr\. Tree]]** |
| 14 | Implementation of tree-based layout algorithms. |