A topology-shape-metrics framework for ortho-radial graph drawing
From MaRDI portal
Publication:6142347
DOI10.1007/s00454-023-00593-yarXiv2106.05734OpenAlexW3166995859MaRDI QIDQ6142347
Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
Publication date: 21 December 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.05734
graph drawingefficient algorithmstopology-shape-metricsortho-radial graph drawingortho-radial representation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bend-optimal orthogonal graph drawing in the general position model
- Orthogonal graph drawing with inflexible edges
- A framework for solving VLSI graph layout problems
- Rectangular-radial drawings of cubic plane graphs
- Lower bounds for planar orthogonal drawings of graphs
- Algorithms for area-efficient orthogonal drawing
- A better heuristic for orthogonal graph drawings
- Orthogonal layout with optimal face complexity
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
- Orthogonal Connector Routing
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Universality considerations in VLSI circuits
- Computing orthogonal drawings with the minimum number of bends
- Flow in Planar Graphs with Multiple Sources and Sinks
- Drawing Metro Maps Using Bézier Curves
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
- Accelerated Bend Minimization
This page was built for publication: A topology-shape-metrics framework for ortho-radial graph drawing
