A linear-time algorithm for drawing a planar graph on a grid
From MaRDI portal
Publication:673676
DOI10.1016/0020-0190(95)00020-DzbMATH Open0875.68452OpenAlexW2038318850WikidataQ126550591 ScholiaQ126550591MaRDI QIDQ673676FDOQ673676
Recommendations
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- scientific article; zbMATH DE number 3509333 (Why is no real title available?)
- scientific article; zbMATH DE number 1256645 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A linear-time algorithm for drawing a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Bemerkungen zum Vierfarbenproblem
- Convex Maps
- Drawing planar graphs using the canonical ordering
- Drawing plane graphs nicely
- Efficient Planarity Testing
- How to Draw a Graph
- How to draw a planar graph on a grid
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(57)- Construction of floorplans for plane graphs over polygonal boundaries
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- A linear-time algorithm for drawing a planar graph on an \((n-2)\times (n-2)\) grid.
- scientific article; zbMATH DE number 841998 (Why is no real title available?)
- Small area drawings of outerplanar graphs
- An annotated review on graph drawing and its applications
- scientific article; zbMATH DE number 2104042 (Why is no real title available?)
- Drawing planar graphs with circular arcs
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- Strictly-convex drawings of 3-connected 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
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- Drawing arrangement graphs in small grids, or how to play planarity
- Metric dimension of maximal outerplanar graphs
- The Euclidean bottleneck full Steiner tree problem
- Straight-Line Drawing of Quadrangulations
- Grid drawings of graphs with constant edge-vertex resolution
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
- scientific article; zbMATH DE number 1990911 (Why is no real title available?)
- Fair redistricting is hard
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Curve-constrained drawings of planar graphs
- An algorithm for constructing star-shaped drawings of plane graphs
- An experimental comparison of four graph drawing algorithms.
- Planar rectilinear drawings of outerplanar graphs in linear time
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- Graph Drawing
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Drawing planar graphs using the canonical ordering
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- Grid embedding of 4-connected plane graphs
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Embedding rectilinear graphs in linear time
- On simultaneous straight-line grid embedding of a planar graph and its dual
- Approximation algorithms for decomposing octilinear polygons
- SOFSEM 2005: Theory and Practice of Computer Science
- scientific article; zbMATH DE number 2069509 (Why is no real title available?)
- Small grid drawings of planar graphs with balanced partition
- An exponential bound for simultaneous embeddings of planar graphs
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- On the complexity of the storyplan problem
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- Feedback vertex set on Hamiltonian graphs
- A linear-time algorithm for drawing a planar graph on a grid
- A note on the subgraphs of the (\(2\times \infty \))-grid
- Minimum-width grid drawings of plane graphs
- Universal slope sets for upward planar drawings
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- Drawing arrangement graphs in small grids, or how to play Planarity
- Computing cartograms with optimal complexity
- New results on drawing angle graphs
- Straight-line drawings of 1-planar graphs
- Planar embedding: linear-time algorithms for vertex placement and edge orderings
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Drawing planar graphs with few geometric primitives
This page was built for publication: A linear-time algorithm for drawing 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 Q673676)
