Hexagonal grid drawings: Algorithms and lower bounds
From MaRDI portal
Recommendations
- Drawing the almost convex set in an integer grid of minimum size
- A linear-time algorithm for drawing a planar graph on a grid
- An efficient orthogonal grid drawing algorithm for cubic graphs
- scientific article; zbMATH DE number 6379
- scientific article; zbMATH DE number 2069509
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Greedy drawings of triangulations
- An Algorithm to Construct Greedy Drawings of Triangulations
- An Algorithm to Construct Greedy Drawings of Triangulations
This page was built for publication: Hexagonal grid drawings: Algorithms and lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711616)