
7
Planar Orthogonal and Polyl i ne
Drawing Algorithms
Christian A. Duncan
Quinnipiac University
Michael T. Goodrich
University of California, Irvine
7.1 Introd uct i on . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 223
7.2 Preli min ar ies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 224
Definitions
•
Canonical Ordering and Shifting Sets
•
Visibility Representations
•
Network Flows
7.3 Orth ogona l Drawings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234
Orthogonal Drawings from Visibility Representations
•
Network Flow Algorithms ...