Next: MINIMUM LENGTH TRIANGULATION
Previous: MINIMUM K-SWITCHING NETWORK
Directed planar graph
A planar orthogonal drawing of G, i.e., a drawing mapping vertices of G into
points in the plane and edges of G into chains of horizontal and vertical
segments such that no two edges cross.
Number of bends in the drawing.
- Bad News:
Not approximable within