Recommendations
Cites work
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A unified approach to visibility representations of planar graphs
- Efficient Planarity Testing
- How to Draw a Graph
- Planar graphs and poset dimension
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Representing a planar graph by vertical lines joining different levels
- Universality considerations in VLSI circuits
Cited in
(only showing first 100 items - show all)- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
- Tree drawings revisited
- Straight line embeddings of rooted star forests in the plane
- Radial drawings of graphs: geometric constraints and trade-offs
- Simultaneous graph embedding with bends and circular arcs
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Universal slope sets for 1-bend planar drawings
- Crossing number for graphs with bounded pathwidth
- Computational complexity of motion planning of a robot through simple gadgets
- Cyclic Level Planarity Testing and Embedding
- A Polynomial Bound for Untangling Geometric Planar Graphs
- The efficient recognition on net-extensibility of graphs
- A more compact visibility representation
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- Right Angle Crossing Drawings of Graphs
- A Note on Universal Point Sets for Planar Graphs
- On the red/blue spanning tree problem
- An Algorithm to Construct Greedy Drawings of Triangulations
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Rigid realizations of graphs on small grids
- Planar 3-SAT with a clause/variable cycle
- Are there any good digraph width measures?
- Large angle crossing drawings of planar graphs in subquadratic area
- Acyclic coloring with few division vertices
- A force-directed algorithm that preserves edge-crossing properties
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
- Improved bounds for drawing trees on fixed points with L-shaped edges
- Approximate proximity drawings
- Small grid drawings of planar graphs with balanced partition
- Drawing arrangement graphs in small grids, or how to play Planarity
- Schnyder woods, \(\mathrm{SLE}_{16}\), and Liouville quantum gravity
- Upward straight-line embeddings of directed graphs into point sets
- Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique
- Universal point sets for planar three-trees
- Faster approximate diameter and distance oracles in planar graphs
- Drawings of planar graphs with few slopes and segments
- 4-labelings and grid embeddings of plane quadrangulations
- A polynomial bound for untangling geometric planar graphs
- Polychromatic colorings of arbitrary rectangular partitions
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- On simultaneous straight-line grid embedding of a planar graph and its dual
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Grid embedding of 4-connected plane graphs
- Minimum-width grid drawings of plane graphs
- Morphing planar graph drawings with bent edges
- On a class of covering problems with variable capacities in wireless networks
- An annotated review on graph drawing and its applications
- Intersection graphs of L-shapes and segments in the plane
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs
- Drawing plane triangulations with few segments
- Universal slope sets for upward planar drawings
- Triangulating planar graphs while minimizing the maximum degree
- Point-set embeddings of plane 3-trees
- Orthogeodesic point-set embedding of trees
- Rectangular grid drawings of plane graphs
- Quasi-planar Graphs
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
- scientific article; zbMATH DE number 7559402 (Why is no real title available?)
- Non-aligned drawings of planar graphs
- Snapping graph drawings to the grid optimally
- Bitonic st-orderings for upward planar graphs
- A heuristic approach towards drawings of graphs with high crossing resolution
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- An exponential bound for simultaneous embeddings of planar graphs
- Outer 1-planar graphs
- Small point sets for simply-nested planar graphs
- Drawing trees in a streaming model
- Planar minimally rigid graphs and pseudo-triangulations
- On local transformations in plane geometric graphs embedded on small grids
- Representation of Planar Hypergraphs by Contacts of Triangles
- Constrained point-set embeddability of planar graphs
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Colored simultaneous geometric embeddings and universal pointsets
- New results on drawing angle graphs
- Small universal point sets for \(k\)-outerplanar graphs
- Drawing graphs on rectangular grids
- Free edge lengths in plane graphs
- The approximate rectangle of influence drawability problem
- Straight-line drawings of 1-planar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- An experimental study on the ply number of straight-line drawings
- Geometry and generation of a new graph planarity game
- The number of Reidemeister moves needed for unknotting
- Rectangular grid drawings of plane graphs
- A linear-time algorithm for drawing a planar graph on a grid
- Visibility representations of toroidal and Klein-bottle graphs
- Mondshein sequences (a.k.a. (2,1)-orders)
- Drawing planar graphs on \(\frac{8}{9}n^2\) area
- Triangulating planar graphs while keeping the pathwidth small
- On the number of upward planar orientations of maximal planar graphs
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- Pointed drawings of planar graphs
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Green's theorem and isolation in planar graphs
- scientific article; zbMATH DE number 7286697 (Why is no real title available?)
- Acyclic colorings of graph subdivisions revisited
This page was built for publication: How to draw a planar graph on a grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804582)
