Wiki source code of Layout Algorithms (KLay)
Version 3.1 by cds on 2012/03/23 15:16
Show last authors
| author | version | line-number | content |
|---|---|---|---|
| 1 | {{panel title="Project Information"}} | ||
| 2 | Responsible: | ||
| 3 | |||
| 4 | * [[Miro Spönemann>>url:http://www.informatik.uni-kiel.de/en/rtsys/contact/msp/||shape="rect"]] | ||
| 5 | * [[Christoph Daniel Schulze>>url:http://www.informatik.uni-kiel.de/en/rtsys/contact/cds/||shape="rect"]] | ||
| 6 | |||
| 7 | Related Theses: | ||
| 8 | |||
| 9 | * Ole Claußen, //Implementing an Algorithm for Orthogonal Graph Layout//, September 2010 ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/theses/ocl-bt.pdf||shape="rect"]]) | ||
| 10 | * Christian Kutschmar, //Planarisierung von Hypergraphen//, September 2010 ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/theses/cku-bt.pdf||shape="rect"]]) | ||
| 11 | {{/panel}} | ||
| 12 | |||
| 13 | |||
| 14 | |||
| 15 | The KLay project encompasses all 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)]]. | ||
| 16 | |||
| 17 | We currently have the following layout algorithms: | ||
| 18 | |||
| 19 | * **KLay Layered** | ||
| 20 | Implementation of the layer-based "hierarchical" approach by Sugiyama et al. | ||
| 21 | * **KLay Force** | ||
| 22 | Implementation of approaches based on physical models. | ||
| 23 | * **KLay Planar** | ||
| 24 | Implementation of the planarization-based "topology-shape-metrics" approach. (work in progress) |