Drawing planar graphs on 89n^2 area
From MaRDI portal
Publication:5300977
Recommendations
Cites work
Cited in
(13)- A note on universal point sets for planar graphs
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Grid drawings of graphs with constant edge-vertex resolution
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
- Limitations on realistic hyperbolic graph drawing
- Universal point sets for planar three-trees
- Orthogeodesic point-set embedding of trees
- Drawing Planar Graphs with Reduced Height
- Small grid drawings of planar graphs with balanced partition
- Minimizing the Area for Planar Straight-Line Grid Drawings
- Orthogeodesic point-set embedding of trees
- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
- A Note on Universal Point Sets for Planar Graphs
This page was built for publication: Drawing planar graphs on \(\frac{8}{9}n^2\) area
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300977)