Pages that link to "Item:Q804582"
From MaRDI portal
The following pages link to How to draw a planar graph on a grid (Q804582):
Displayed 50 items.
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- Long alternating paths in bicolored point sets (Q941368) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- A force-directed algorithm that preserves edge-crossing properties (Q1607039) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Decidability of string graphs (Q1887714) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- On a straight-line embedding problem of graphs (Q1916126) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (Q1920431) (← links)
- Straight line embeddings of rooted star forests in the plane (Q1975369) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- On local transformations in plane geometric graphs embedded on small grids (Q2462732) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths (Q2566278) (← links)
- The number of Reidemeister moves needed for unknotting (Q2701705) (← links)
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) (Q3605507) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges (Q3611849) (← links)
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints (Q3611859) (← links)
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three (Q3611877) (← links)
- On Triangle Contact Graphs (Q4305318) (← links)
- Decision Trees for Geometric Models (Q4513214) (← links)
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS (Q4675884) (← links)
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets (Q5302049) (← links)
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges (Q5302051) (← links)
- A Lower Bound on the Area Requirements of Series-Parallel Graphs (Q5302052) (← links)
- Four-Connected Spanning Subgraphs of Doughnut Graphs (Q5452160) (← links)
- Listing All Plane Graphs (Q5452167) (← links)
- Cyclic Level Planarity Testing and Embedding (Q5452210) (← links)
- Representation of Planar Hypergraphs by Contacts of Triangles (Q5452217) (← links)
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893) (← links)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5901462) (← links)