Non-planar square-orthogonal drawing with few-bend edges
From MaRDI portal
Publication:744098
Recommendations
Cites work
- A better heuristic for orthogonal graph drawings
- A simple linear time algorithm for proper box rectangular drawings of plane graphs
- Algorithms for area-efficient orthogonal drawing
- Area-efficient static and incremental graph drawings
- Drawing graphs on rectangular grids
- Efficient orthogonal drawings of high degree graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
Cited in
(2)
This page was built for publication: Non-planar square-orthogonal drawing with few-bend edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744098)