Pages that link to "Item:Q1182115"
From MaRDI portal
The following pages link to Lower bounds for planar orthogonal drawings of graphs (Q1182115):
Displaying 13 items.
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Bend-optimal orthogonal drawings of triconnected plane graphs (Q1713568) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- Schnyder decompositions for regular plane graphs and application to drawing (Q2429329) (← links)
- Efficient Algorithms for Ortho-Radial Graph Drawing. (Q5088985) (← links)
- -shaped point set embeddings of high-degree plane graphs (Q5154585) (← links)
- Planar Confluent Orthogonal Drawings of 4-Modal Digraphs (Q6075712) (← links)
- A topology-shape-metrics framework for ortho-radial graph drawing (Q6142347) (← links)
