Code | Description | Time | Preconditions |
---|---|---|---|

0 | QuickOrthogonalBased on a visibility representation of the given embedding, with a bend-minimization heuristic. A min-cost-flow compaction technique is also applied to minimize edge lengths. |
O(n) | 4-degree AND biconnected. |

1 | OptimalOrthogonalBased on a bend-minimization min-cost-flow technique. A min-cost-flow compaction technique is also applied to minimize edge lengths. Returns the orthogonal layout with the minimum number of bends for the given embedding. |
O(n^{2} log n) |
No preconditions. |

2 | SlowOrthogonalBased on a bend-minimization min-cost-flow technique applied on embeddings generated with a branch-and-bound technique by means of an SPQR-tree. A min-cost-flow compaction technique is also applied to minimize edge lengths. Returns the orthogonal layout with the minimum number of bends over all the planar embeddings. |
O(exp(n)) | Biconnected AND planar. |

3 | OptimalUpwardBased on a bend-minimization min-cost-flow technique. A min-cost-flow compaction technique is also applied to minimize edge lengths. Returns the quasi-upward layout with the minimum number of bends for the given embedding. |
O(n^{2} log n) |
Directed. |

4 | SlowUpwardBased on a bend-minimization min-cost-flow technique applied on embeddings generated with a branch-and-bound technique by means of an SPQR-tree. A min-cost-flow compaction technique is also applied to minimize edge lengths. Returns the quasi-upward layout with the minimum number of bends over all the planar embeddings. |
O(exp(n)) | Biconnected AND directed AND bimodal AND planar. |

5 | OptimalUpwardVisbilityOriented visibility representation of a layout generated by the OptimalUpward algorithm. |
O(n^{2} log n) |
Directed. |

6 | SlowUpwardVisibilityOriented visibility representation of a layout generated by the SlowUpward algorithm. |
O(exp(n)) | Biconnected AND directed AND bimodal AND planar. |

7 | PolylineBased on the visibility algorithm. Returns a polyline layout with at most two bends per edge. |
O(n) | Biconnected. |

8 | VisibilityBased on st-numbering. A min-cost-flow compaction technique is also applied to minimize edge lengths. Returns an unoriented visibility representation. |
O(n) | Biconnected. |

9 | TreeCenterSonsReturns a hierarchical representation in which each node is above and horizontally centered with respect to its sons. |
O(n) | Acyclic (regardless edge directions). |

10 | TreeCenterSubtreeReturns a hierarchical representation in which each node is above and horizontally centered with respect to its whole subtree. |
O(n) | Acyclic (regardless edge directions). |

Website design by INTEGRA Sistemi, www.IntegraSistemi.it