Key points are not available for this paper at this time.
We define graph drawing algorithms which simultaneously generalize several classical ones. More precisely, we consider the following algorithms: (a) Fusy's algorithm for the straight-line grid drawing of planar triangulations, based on transversal structures, (b) Barri\`ere and Huemmer's algorithm for the straight-line grid drawing of planar quadrangulations, based on separating decompositions, (c) He's algorithm for the orthogonal drawing of 3-valent planar maps, based on transversal structures, (d) Bernardi \& Fusy 's algorithm for the orthogonal drawing of 4-valent planar maps, based on 2-orientations. We present an algorithm generalizing (a) and (b) which produces a straight line grid drawing for planar maps with faces of degree at most 4, and we present an algorithm generalizing (c) and (d) which produces an orthogonal drawing for planar maps with vertices of degree at most 4. Our two algorithms are based on a class of combinatorial structures called grand-Schnyder woods.
Bernardi et al. (2024) studied this question.