Bend-optimal orthogonal graph drawing in the general position model
From MaRDI portal
Publication:390165
Recommendations
Cites work
- scientific article; zbMATH DE number 139786 (Why is no real title available?)
- scientific article; zbMATH DE number 1943970 (Why is no real title available?)
- A better heuristic for orthogonal graph drawings
- Area-efficient static and incremental graph drawings
- Drawing graphs on rectangular grids
- Hamiltonian orthogeodesic alternating paths
- Manhattan-geodesic embedding of planar graphs
- Matching theory
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On minimal-node-cost planar embeddings
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- Rectangular drawings of planar graphs
- Three-dimensional orthogonal graph drawing algorithms
- Three-dimensional orthogonal graph drawing with optimal volume
Cited in
(8)- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
- HV-planarity: algorithms and complexity
- Universal slope sets for 1-bend planar drawings
- scientific article; zbMATH DE number 2080110 (Why is no real title available?)
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- A topology-shape-metrics framework for ortho-radial graph drawing
- Relating bends and size in orthogonal graph drawings
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)