Efficient Algorithms for Ortho-Radial Graph Drawing.
From MaRDI portal
Publication:5088985
DOI10.4230/LIPICS.SOCG.2019.53OpenAlexW2932081406MaRDI QIDQ5088985FDOQ5088985
Authors: Benjamin Niedermann, Ignaz Rutter, Matthias Wolf 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.05048
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
graph drawingefficient algorithmstopology-shape-metricsortho-radial graph drawingortho-radial representation
Cites Work
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Universality considerations in VLSI circuits
- Ortho-radial drawing of graphs
- Title not available (Why is that?)
- Algorithms for area-efficient orthogonal drawing
- Rectangular-radial drawings of cubic plane graphs
- Lower bounds for planar orthogonal drawings of graphs
- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
- Orthogonal connector routing
Cited In (6)
- Computing Radial Drawings on the Minimum Number of Circles
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- Title not available (Why is that?)
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
- The DFS-heuristic for orthogonal graph drawing
- Algorithms for area-efficient orthogonal drawing
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)
