Schnyder Woods or How to Draw a Planar Graph?
Stefan Felsner · Advanced lectures in mathematics · 2004
One of the most fundamental problems around a planar graph is the question: How should the graph be drawn? This, of course, is less a mathematical question and more a matter of taste. In the graph drawing literature many answers are offered. In this chapter we present some results about drawings and other representations of (3-connected) planar graphs. The results are based on the structure of Schnyder woods. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.