
9
Circular Drawing Algorithms
Janet M. Six
Lone Star Interaction Design
Ioannis G. Tollis
University of Crete and
Technology Hellas-FORTH
9.1 Introd uct i on . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
Other Circular Drawing Techniques
•
Complexity of the
Circular Graph Drawing Problem
9.2 Circular Drawings of Biconnected Gr aph s . . . . . . . . . . . . . . 288
Prope r t ies of Algorithm CIRCULAR
9.3 Fu rt h er Reduction of Edge Crossings . . . . . . . . . . . . . . . . . . . 292
Counting All the Crossings in a Circular Drawing
•
Determining the New Number of Crossings after Moving a
Node
9.4 Nonbiconnected ...