Bend-optimal orthogonal graph drawing in the general position model
From MaRDI portal
Publication:390165
DOI10.1016/j.comgeo.2013.03.002zbMath1408.65008OpenAlexW2063780329MaRDI QIDQ390165
Stefan Felsner, Pavel Valtr, Michael Kaufmann
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.03.002
Related Items
HV-planarity: algorithms and complexity ⋮ Universal slope sets for 1-bend planar drawings ⋮ A topology-shape-metrics framework for ortho-radial graph drawing ⋮ An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
Cites Work
- Area-efficient static and incremental graph drawings
- Matching theory
- A better heuristic for orthogonal graph drawings
- Three-dimensional orthogonal graph drawing algorithms
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- Drawing graphs on rectangular grids
- Three-dimensional orthogonal graph drawing with optimal volume
- Hamiltonian Orthogeodesic Alternating Paths
- On minimal-node-cost planar embeddings
- Manhattan-Geodesic Embedding of Planar Graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Rectangular drawings of planar graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Bend-optimal orthogonal graph drawing in the general position model
