scientific article; zbMATH DE number 1693471
From MaRDI portal
Publication:2764040
Recommendations
Cited in
(24)- Topology Preserving Constrained Graph Layout
- Efficient orthogonal drawings of high degree graphs
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Slanted orthogonal drawings: model, algorithms and evaluations
- Graph compact orthogonal layout algorithm
- A simple graphical method for orthogonal rotation of axes
- Interactive orthogonal graph drawing
- Convexity-increasing morphs of planar graphs
- Slanted orthogonal drawings
- Relating bends and size in orthogonal graph drawings
- Orthogonal connector routing
- scientific article; zbMATH DE number 1974108 (Why is no real title available?)
- Orthogonal graph drawing with inflexible edges
- Overloaded orthogonal drawings
- Orthogonal drawings of graphs with vertex and edge labels
- The Turing Test for Graph Drawing Algorithms
- On vertex- and empty-ply proximity drawings
- Orthogonal Drawings of Plane Graphs Without Bends
- scientific article; zbMATH DE number 1974102 (Why is no real title available?)
- Techniques for the Refinement of Orthogonal Graph Drawings
- Distinguishing orthogonality graphs
- scientific article; zbMATH DE number 1974137 (Why is no real title available?)
- The distance orientation problem
- Orthogonal Hypergraph Drawing for Improved Visibility
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764040)