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)
- 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
- 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
- Approximate Proximity Drawings
- 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
- Advances in the theory and practice of graph drawing
- Connectivity check in 3-connected planar graphs with obstacles
- A Lower Bound on the Area Requirements of Series-Parallel Graphs
- Small grid embeddings of 3-polytopes
- Four-Connected Spanning Subgraphs of Doughnut Graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- On a straight-line embedding problem of graphs
- Triangulating planar graphs while minimizing the maximum degree
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
- Balanced vertex-orderings of graphs
- Drawing planar graphs using the canonical ordering
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- A note on Schnyder's theorem
- Embedding planar graphs at fixed vertex locations
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Strictly-convex drawings of 3-connected planar graphs
- Computing cartograms with optimal complexity
- Curve-constrained drawings of planar graphs
- Area requirement of graph drawings with few crossings per edge
- Decidability of string graphs
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
- On the Density of Non-simple 3-Planar Graphs
- Incremental convex planarity testing
- On the edge-length ratio of planar graphs
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- The partial visibility representation extension problem
- Optimal two-sided embeddings of complete binary trees in rectangular grids
- A duality transform for constructing small grid embeddings of 3d polytopes
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- The within-strip discrete unit disk cover problem
- Orthogonal cartograms with at most 12 corners per face
- Reprint of: ``Grid representations and the chromatic number
- Upward planar drawings on the standing and the rolling cylinders
- 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
- A Note on Universal Point Sets for Planar Graphs
- Drawing Planar Graphs on Area
- The efficient recognition on net-extensibility of graphs
- 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
- Compact Grid Representation of Graphs
- 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
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)
