How to draw a planar graph on a grid
From MaRDI portal
Publication:804582
DOI10.1007/BF02122694zbMATH Open0728.05016DBLPjournals/combinatorica/FraysseixPP90OpenAlexW2003525146WikidataQ57253826 ScholiaQ57253826MaRDI QIDQ804582FDOQ804582
Authors: Hubert de Fraysseix, János Pach, Richard Pollack 
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02122694
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Planar graphs and poset dimension
- Efficient Planarity Testing
- Title not available (Why is that?)
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- How to Draw a Graph
- Universality considerations in VLSI circuits
- Representing a planar graph by vertical lines joining different levels
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Radial drawings of graphs: geometric constraints and trade-offs
- Simultaneous graph embedding with bends and circular arcs
- A Note on Universal Point Sets for Planar Graphs
- Drawing Planar Graphs on Area
- The efficient recognition on net-extensibility of graphs
- Large angle crossing drawings of planar graphs in subquadratic area
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Are there any good digraph width measures?
- A force-directed algorithm that preserves edge-crossing properties
- Small grid drawings of planar graphs with balanced partition
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
- Grid embedding of 4-connected plane 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
- Triangulating planar graphs while minimizing the maximum degree
- Drawing plane triangulations with few segments
- Orthogeodesic point-set embedding of trees
- An exponential bound for simultaneous embeddings of planar graphs
- Conflict-Free Coloring of Intersection Graphs
- Small point sets for simply-nested planar graphs
- A heuristic approach towards drawings of graphs with high crossing resolution
- Representation of Planar Hypergraphs by Contacts of Triangles
- On local transformations in plane geometric graphs embedded on small grids
- Small universal point sets for \(k\)-outerplanar graphs
- Mondshein sequences (a.k.a. (2,1)-orders)
- Rectangular grid drawings of plane graphs
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
- Morphing Planar Graph Drawings with Bent Edges
- A note on universal point sets for planar graphs
- Title not available (Why is that?)
- Grid drawings of graphs with constant edge-vertex resolution
- Compact grid representation of graphs
- Grid straight-line embeddings of trees with a minimum number of bends per path
- A simple recognition of maximal planar graphs
- Plane 3-Trees: Embeddability and Approximation
- Grid representations and the chromatic number
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
- Every collinear set in a planar graph is free
- A note on isosceles planar graph drawing
- Zen puzzle garden is NP-complete
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Planar Bichromatic Bottleneck Spanning Trees
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes
- Compact drawings of 1-planar graphs with right-angle crossings and few bends
- Arc diagrams, flip distances, and Hamiltonian triangulations
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Two algorithms for finding rectangular duals of planar graphs
- A result on k-valent graphs and its application to a graph embedding problem
- Long alternating paths in bicolored point sets
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- Tree drawings revisited
- Geometry and Generation of a New Graph Planarity Game
- Planarity-preserving clustering and embedding for large planar graphs
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Cyclic Level Planarity Testing and Embedding
- A Polynomial Bound for Untangling Geometric Planar Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- On the red/blue spanning tree problem
- Rigid realizations of graphs on small grids
- 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)
- Acyclic coloring with few division vertices
- Approximate proximity drawings
- Optimal polygonal representation of planar graphs
- Upward straight-line embeddings of directed graphs into point sets
- Drawings of planar graphs with few slopes and segments
- A polynomial bound for untangling geometric planar graphs
- Polychromatic colorings of arbitrary rectangular partitions
- 4-labelings and grid embeddings of plane quadrangulations
- Minimum-width grid drawings of plane graphs
- Intersection graphs of L-shapes and segments in the plane
- Point-set embeddings of plane \(3\)-trees
- Drawing Planar Graphs with Few Geometric Primitives
- Title not available (Why is that?)
- Outer 1-planar graphs
- Recognizing and drawing IC-planar graphs
- Drawing trees in a streaming model
- Planar minimally rigid graphs and pseudo-triangulations
- Drawing graphs on rectangular grids
- New results on drawing angle graphs
- Colored simultaneous geometric embeddings and universal pointsets
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- The number of Reidemeister moves needed for unknotting
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- A linear-time algorithm for drawing a planar graph on a grid
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Pointed drawings of planar graphs
- Acyclic colorings of graph subdivisions revisited
- Decision Trees for Geometric Models
- Green's theorem and isolation in planar graphs
- Small area drawings of outerplanar graphs
- On Triangle Contact Graphs
- Area requirement and symmetry display of planar upward drawings
- A left-first search algorithm for planar graphs
- On simultaneous planar graph embeddings
- Visibility representation of plane graphs via canonical ordering tree
- Area-efficient planar straight-line drawings of outerplanar graphs
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)
