Efficient Algorithms for Ortho-Radial Graph Drawing.
From MaRDI portal
Publication:5088985
Recommendations
- Ortho-radial drawing of graphs
- Towards a topology-shape-metrics framework for ortho-radial drawings
- Computing Radial Drawings on the Minimum Number of Circles
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
- Algorithms for area-efficient orthogonal drawing
Cites work
- scientific article; zbMATH DE number 1445279 (Why is no real title available?)
- Algorithms for area-efficient orthogonal drawing
- Lower bounds for planar orthogonal drawings of graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Ortho-radial drawing of graphs
- Orthogonal connector routing
- Rectangular-radial drawings of cubic plane graphs
- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
- Universality considerations in VLSI circuits
Cited in
(6)- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
- scientific article; zbMATH DE number 7286697 (Why is no real title available?)
- The DFS-heuristic for orthogonal graph drawing
- Algorithms for area-efficient orthogonal drawing
- Computing Radial Drawings on the Minimum Number of Circles
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
This page was built for publication: Efficient Algorithms for Ortho-Radial Graph Drawing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088985)