Taking both perceptual organization and aesthetic criteria into account is the key to high-quality diagram layout, but makes for a more difficult problem than pure aesthetic layout. Computing the layout of a network diagram that exhibits a specified perceptual organization can be phrased as a constraint-satisfaction problem. Some constraints are derived from the perceptual-organization specification: the nodes in the diagram must be positioned so that they form specified perceptual gestalts, i.e., certain groups of nodes must form perceptual groupings by proximity, or symmetry, or shape motif, etc. Additional constraints are derived from aesthetic considerations: the layout should satisfy criteria that concern the number of link crossings, the sum of link lengths, or diagram area, etc. Using a generalization of a simple mass-spring layout technique to 'satisfice' constraints, we show how to produce high-quality layouts with specified perceptual organization for medium-sized diagrams (10-30 nodes) in under 30 seconds on a workstation.<<ETX>>
[1]
Satoru Kawai,et al.
An Algorithm for Drawing General Undirected Graphs
,
1989,
Inf. Process. Lett..
[2]
Joe Marks,et al.
Automating the layout of network diagrams with specified visual organization
,
1994,
IEEE Trans. Syst. Man Cybern..
[3]
Ioannis G. Tollis,et al.
Algorithms for Drawing Graphs: an Annotated Bibliography
,
1988,
Comput. Geom..
[4]
Joe Marks,et al.
A formal specification scheme for network diagrams that facilitates automated design
,
1991,
J. Vis. Lang. Comput..
[5]
Joe Marks,et al.
A Parallel Genetic Algorithm for Network-Diagram Layout
,
1991,
ICGA.
[6]
S. Kosslyn.
Understanding charts and graphs
,
1989
.
[7]
Ehud Reiter,et al.
Avoiding Unwanted Conversational Implicatures in Text and Graphics
,
1990,
AAAI.
[8]
David S. Johnson,et al.
Crossing Number is NP-Complete
,
1983
.