A linear-time algorithm for drawing a planar graph on a grid
From MaRDI portal
(Redirected from Publication:673676)
Recommendations
Cites work
- 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
- 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?)
- 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
(62)- Small area drawings of outerplanar graphs
- An algorithm for constructing star-shaped drawings of plane graphs
- Embedding rectilinear graphs in linear time
- Minimum-width grid drawings of plane graphs
- Grid embedding of 4-connected plane graphs
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- New results on drawing angle graphs
- An algorithm for straight-line drawing of planar graphs
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Drawing planar graphs using the canonical ordering
- Metric dimension of maximal outerplanar graphs
- Planar rectilinear drawings of outerplanar graphs in linear time
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Grid drawings of graphs with constant edge-vertex resolution
- The Euclidean bottleneck full Steiner tree problem
- Fair redistricting is hard
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- Approximation algorithms for decomposing octilinear polygons
- An experimental comparison of four graph drawing algorithms.
- Feedback vertex set on Hamiltonian graphs
- Drawing arrangement graphs in small grids, or how to play planarity
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- A linear-time algorithm for drawing a planar graph on an (n-2) (n-2) grid.
- Straight-Line Drawing of Quadrangulations
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- Planar embedding: linear-time algorithms for vertex placement and edge orderings
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
- scientific article; zbMATH DE number 1990911 (Why is no real title available?)
- scientific article; zbMATH DE number 2069509 (Why is no real title available?)
- Drawing planar graphs with few geometric primitives
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- scientific article; zbMATH DE number 2104042 (Why is no real title available?)
- scientific article; zbMATH DE number 841998 (Why is no real title available?)
- A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems
- Drawing arrangement graphs in small grids, or how to play Planarity
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- SOFSEM 2005: Theory and Practice of Computer Science
- Graph Drawing
- Computing cartograms with optimal complexity
- Universal slope sets for upward planar drawings
- Drawing planar graphs with circular arcs
- Straight-line drawings of 1-planar graphs
- An exponential bound for simultaneous embeddings of planar graphs
- On the complexity of the storyplan problem
- Strictly-convex drawings of 3-connected planar graphs
- An annotated review on graph drawing and its applications
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Construction of floorplans for plane graphs over polygonal boundaries
- A linear-time algorithm for drawing a planar graph on a grid
- On self-duality and unigraphicity for 3-polytopes
- Monotone arc diagrams with few biarcs
- Small grid drawings of planar graphs with balanced partition
- Curve-constrained drawings of planar graphs
- How to draw a planar graph on a grid
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- On simultaneous straight-line grid embedding of a planar graph and its dual
- A note on the subgraphs of the (\(2\times \infty \))-grid
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)
