Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Planar graphs, via well-orderly maps and trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On simultaneous straight-line grid embedding of a planar graph and its dual
Information Processing Letters
Convex drawings of graphs with non-convex boundary constraints
Discrete Applied Mathematics
An algorithm for constructing star-shaped drawings of plane graphs
Computational Geometry: Theory and Applications
Straight-line drawing of quadrangulations
GD'06 Proceedings of the 14th international conference on Graph drawing
Schnyder woods and orthogonal surfaces
GD'06 Proceedings of the 14th international conference on Graph drawing
On the number of α-orientations
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
A note on minimum-area straight-line drawings of planar graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Transversal structures on triangulations, with application to straight-line drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Convex grid drawings of plane graphs with rectangular contours
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Theoretical Computer Science
| Hi-index | 0.00 |
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n−2−Δ) ×(n−2−Δ). The parameter Δ≥ 0 depends on the the Schnyder wood used for the drawing. This parameter is in the range $0 \leq \Delta\leq \frac{n}{2}-2$.