Efficient Algorithms for Ortho-Radial Graph Drawing.

DOI10.4230/LIPIcs.SoCG.2019.53OpenAlexW2932081406MaRDI QIDQ5088985

Benjamin Niedermann, Ignaz Rutter, Matthias Wolf

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1903.05048

zbMATH Keywords

graph drawingefficient algorithmstopology-shape-metricsortho-radial graph drawingortho-radial representation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings

Cites Work

• Unnamed Item
• Unnamed Item
• Rectangular-radial drawings of cubic plane graphs
• Lower bounds for planar orthogonal drawings of graphs
• Algorithms for area-efficient orthogonal drawing
• 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

This page was built for publication: Efficient Algorithms for Ortho-Radial Graph Drawing.