Bend-optimal orthogonal graph drawing in the general position model
From MaRDI portal
Publication:390165
DOI10.1016/J.COMGEO.2013.03.002zbMATH Open1408.65008OpenAlexW2063780329MaRDI QIDQ390165FDOQ390165
Authors: Stefan Felsner, Michael Kaufmann, Pavel Valtr 
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
Recommendations
Cites Work
- Matching theory
- Three-dimensional orthogonal graph drawing algorithms
- A better heuristic for orthogonal graph drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Title not available (Why is that?)
- Area-efficient static and incremental graph drawings
- Manhattan-geodesic embedding of planar graphs
- 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
- Title not available (Why is that?)
- Rectangular drawings of planar graphs
Cited In (8)
- Universal slope sets for 1-bend planar drawings
- HV-planarity: algorithms and complexity
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- Relating bends and size in orthogonal graph drawings
- Title not available (Why is that?)
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
- A topology-shape-metrics framework for ortho-radial graph drawing
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
This page was built for publication: Bend-optimal orthogonal graph drawing in the general position model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390165)
