Bipolar orientations revisited
Discrete Applied Mathematics - Special issue: Fifth Franco-Japanese Days, Kyoto, October 1992
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Transversal structures on triangulations, with application to straight-line drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Convex drawings of 3-connected plane graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
Bijective counting of plane bipolar orientations and Schnyder woods
European Journal of Combinatorics
On Open Rectangle-of-Influence Drawings of Planar Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Bijections for Baxter families and related objects
Journal of Combinatorial Theory Series A
4-Labelings and grid embeddings of plane quadrangulations
GD'09 Proceedings of the 17th international conference on Graph Drawing
| Hi-index | 0.00 |
This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It outputs in linear time a drawing on a regular W×H grid such that W+H = n - 1 - Δ, where n is the number of vertices and Δ is an explicit combinatorial parameter of the quadrangulation.