How to draw a planar graph on a grid
From MaRDI portal
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)- Representation of Planar Hypergraphs by Contacts of Triangles
- Conflict-free coloring of intersection graphs
- A result on k-valent graphs and its application to a graph embedding problem
- Drawing planar graphs on \(\frac{8}{9}n^2\) area
- Radial drawings of graphs: geometric constraints and trade-offs
- Simultaneous graph embedding with bends and circular arcs
- Tree drawings revisited
- A note on universal point sets for planar graphs
- Plane 3-trees: embeddability and approximation
- Morphing planar graph drawings with bent edges
- Tree drawings revisited
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- On local transformations in plane geometric graphs embedded on small grids
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- A note on isosceles planar graph drawing
- Zen puzzle garden is NP-complete
- Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- A simple recognition of maximal planar graphs
- Grid drawings of graphs with constant edge-vertex resolution
- Small point sets for simply-nested planar graphs
- A heuristic approach towards drawings of graphs with high crossing resolution
- Geometry and generation of a new graph planarity game
- Mondshein sequences (a.k.a. (2,1)-orders)
- Drawing plane triangulations with few segments
- Planarity-preserving clustering and embedding for large planar graphs
- Long alternating paths in bicolored point sets
- Rectangular grid drawings of plane graphs
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Are there any good digraph width measures?
- Grid embedding of 4-connected plane graphs
- Improved bounds for drawing trees on fixed points with L-shaped edges
- Compact grid representation of graphs
- On simultaneous straight-line grid embedding of a planar graph and its dual
- A force-directed algorithm that preserves edge-crossing properties
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Small grid drawings of planar graphs with balanced partition
- An exponential bound for simultaneous embeddings of planar graphs
- Grid representations and the chromatic number
- Orthogeodesic point-set embedding of trees
- Small universal point sets for \(k\)-outerplanar graphs
- Proportional contact representations of planar graphs
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Grid straight-line embeddings of trees with a minimum number of bends per path
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Large angle crossing drawings of planar graphs in subquadratic area
- A Note on Universal Point Sets for Planar Graphs
- Planar Bichromatic Bottleneck Spanning Trees
- Two algorithms for finding rectangular duals of planar graphs
- Green's theorem and isolation in planar graphs
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Triangulating planar graphs while minimizing the maximum degree
- Approximate proximity drawings
- Small area drawings of outerplanar graphs
- A left-first search algorithm for planar graphs
- Colored simultaneous geometric embeddings and universal pointsets
- Connectivity check in 3-connected planar graphs with obstacles
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Area requirement of graph drawings with few crossings per edge
- A Lower Bound on the Area Requirements of Series-Parallel Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
- Incremental convex planarity testing
- Small grid embeddings of 3-polytopes
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- On Triangle Contact Graphs
- Triangulating planar graphs while minimizing the maximum degree
- Drawing trees in a streaming model
- Strictly-convex drawings of 3-connected planar graphs
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Intersection graphs of L-shapes and segments in the plane
- A polynomial bound for untangling geometric planar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Embedding planar graphs at fixed vertex locations
- Point-set embeddings of plane \(3\)-trees
- Planar minimally rigid graphs and pseudo-triangulations
- Polychromatic colorings of arbitrary rectangular partitions
- Cyclic Level Planarity Testing and Embedding
- 4-labelings and grid embeddings of plane quadrangulations
- Decidability of string graphs
- Upward straight-line embeddings of directed graphs into point sets
- A Polynomial Bound for Untangling Geometric Planar Graphs
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- A duality transform for constructing small grid embeddings of 3d polytopes
- Area requirement and symmetry display of planar upward drawings
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- Curve-constrained drawings of planar graphs
- The efficient recognition on net-extensibility of graphs
- On simultaneous planar graph embeddings
- Visibility representation of plane graphs via canonical ordering tree
- Advances in the theory and practice of graph drawing
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Balanced vertex-orderings of graphs
- Drawing planar graphs using the canonical ordering
- On the edge-length ratio of planar graphs
- 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)
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)
