On simultaneous straight-line grid embedding of a planar graph and its dual
From MaRDI portal
Publication:845659
DOI10.1016/j.ipl.2006.02.010zbMath1184.68367OpenAlexW2003472496MaRDI QIDQ845659
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.02.010
Cites Work
- Unnamed Item
- A linear-time algorithm for drawing a planar graph on a grid
- How to draw a planar graph on a grid
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Planar graphs and poset dimension
- Output-sensitive reporting of disjoint paths
- Simultaneous embedding of a planar graph and its dual on the grid
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- Graph Drawing
- How to Draw a Graph
- Algorithms and Data Structures
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: On simultaneous straight-line grid embedding of a planar graph and its dual