Pages that link to "Item:Q1969947"
From MaRDI portal
The following pages link to Efficient orthogonal drawings of high degree graphs (Q1969947):
Displaying 14 items.
- Area, curve complexity, and crossing resolution of non-planar graph drawings (Q649108) (← links)
- Drawing graphs with right angle crossings (Q719252) (← links)
- Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
- A Riemannian approach to graph embedding (Q856472) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- Optimal three-dimensional orthogonal graph drawing in the general position model. (Q1874390) (← links)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING (Q2708038) (← links)
- Drawing Graphs with Right Angle Crossings (Q3183456) (← links)
- Overloaded Orthogonal Drawings (Q3223958) (← links)
- Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
- Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)