Pages that link to "Item:Q1920418"
From MaRDI portal
The following pages link to Drawing planar graphs using the canonical ordering (Q1920418):
Displaying 50 items.
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Encoding toroidal triangulations (Q527433) (← links)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Schnyder woods and orthogonal surfaces (Q946686) (← links)
- Clean the graph before you draw it! (Q987793) (← links)
- On the two-dimensional orthogonal drawing of series-parallel graphs (Q1026151) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Point matching under non-uniform distortions. (Q1868709) (← links)
- Drawing graphs on rectangular grids (Q1902892) (← links)
- Geodesic obstacle representation of graphs (Q2096390) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Schnyder decompositions for regular plane graphs and application to drawing (Q2429329) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations (Q2441580) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths (Q2566278) (← links)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING (Q2708038) (← links)
- Algorithms for Drawing Planar p-petal Graphs (Q2831832) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Bitonic st-orderings for Upward Planar Graphs (Q2961518) (← links)
- How to Draw a Planarization (Q2971142) (← links)
