| ... |
... |
@@ -44,8 +44,6 @@ |
| 44 |
44 |
|
| 45 |
45 |
* **Layering Algorithms** |
| 46 |
46 |
Develop an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The algorithm shall be extended to consider the number of edge crossings and an optimal aspect ratio. |
| 47 |
|
-* **Node Placement** |
| 48 |
|
-Develop a new node placement algorithm that finds a good balance between keeping edges straight and keeping the drawing from getting too big. |
| 49 |
49 |
* (% style="line-height: 1.4285715;" %)**Compound Graph Layout**(%%) |
| 50 |
50 |
Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be onĀ //maintainability//: ensuring that the implementation can be kept working over the years. |
| 51 |
51 |
* **Force Based Drawing with Port Constraints** |