An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2090004
- Bend Minimization in Planar Orthogonal Drawings Using Integer Programming
- Computing orthogonal drawings with the minimum number of bends
- Computing orthogonal drawings with the minimum number of bends
- Bend-minimum orthogonal drawings in quadratic time
- Optimal orthogonal graph drawing with convex bend costs
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Bend-optimal orthogonal graph drawing in the general position model
Cites work
- A better heuristic for orthogonal graph drawings
- Bend-optimal orthogonal graph drawing in the general position model
- Efficient Algorithms for Ortho-Radial Graph Drawing.
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Optimal orthogonal graph drawing with convex bend costs
- Ortho-radial drawing of graphs
- Orthogonal graph drawing with inflexible edges
- Rectangular-radial drawings of cubic plane graphs
- Towards a topology-shape-metrics framework for ortho-radial drawings
Cited in
(3)
This page was built for publication: An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014120)