A linear-time algorithm for drawing a planar graph on a grid
From MaRDI portal
Publication:673676
DOI10.1016/0020-0190(95)00020-DzbMath0875.68452OpenAlexW2038318850WikidataQ126550591 ScholiaQ126550591MaRDI QIDQ673676
Marek Chrobak, Thomas H. Payne
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00020-d
Related Items
Recognizing and drawing IC-planar graphs ⋮ A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs ⋮ A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ On simultaneous straight-line grid embedding of a planar graph and its dual ⋮ Grid embedding of 4-connected plane graphs ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Drawing planar graphs using the canonical ordering ⋮ New results on drawing angle graphs ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ Feedback vertex set on Hamiltonian graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ An exponential bound for simultaneous embeddings of planar graphs ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ On the complexity of the storyplan problem ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. ⋮ An annotated review on graph drawing and its applications ⋮ Optimal polygonal representation of planar graphs ⋮ Arc diagrams, flip distances, and Hamiltonian triangulations ⋮ Computing cartograms with optimal complexity ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ A linear-time algorithm for drawing a planar graph on a grid ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Small grid drawings of planar graphs with balanced partition ⋮ An experimental comparison of four graph drawing algorithms. ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ Curve-constrained drawings of planar graphs ⋮ Drawing planar graphs with circular arcs ⋮ CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS ⋮ Fair redistricting is hard ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ The partial visibility representation extension problem ⋮ Universal slope sets for upward planar drawings ⋮ Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints ⋮ The Complexity of Several Realizability Problems for Abstract Topological Graphs ⋮ Metric dimension of maximal outerplanar graphs ⋮ Minimum-width grid drawings of plane graphs ⋮ Small area drawings of outerplanar graphs ⋮ CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for drawing a planar graph on a grid
- Drawing plane graphs nicely
- How to draw a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Drawing planar graphs using the canonical ordering
- Bemerkungen zum Vierfarbenproblem
- Efficient Planarity Testing
- How to Draw a Graph
- Convex Maps
This page was built for publication: A linear-time algorithm for drawing a planar graph on a grid
