An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
From MaRDI portal
Publication:5014120
DOI10.1007/978-3-030-68766-3_19OpenAlexW3135898883MaRDI QIDQ5014120
Benjamin Niedermann, Ignaz Rutter
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.10373
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
A topology-shape-metrics framework for ortho-radial graph drawing ⋮ An annotated review on graph drawing and its applications
Cites Work
- Unnamed Item
- Bend-optimal orthogonal graph drawing in the general position model
- Orthogonal graph drawing with inflexible edges
- Rectangular-radial drawings of cubic plane graphs
- A better heuristic for orthogonal graph drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- Efficient Algorithms for Ortho-Radial Graph Drawing.
This page was built for publication: An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings