Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the interpretation of existing graph drawings. A more recent experiment has considered layout aesthetics from the point of view of users moving nodes in an existing graph drawing so as to create a desirable layout. The project reported here extends this research further, by asking participants to use sketching software to draw graphs based on adjacency lists, and to then lay them out -- removing any bias caused by an initial configuration. We find, in common with many other studies, that removing edge crossings is the most significant aesthetic, but also discover that aligning nodes and edges to an underlying grid is important, especially to mal...
The merit of automatic graph layout algorithms is typically judged on their computational efficiency...
The merit of automatic graph layout algorithms is typically judged on their computational effciency ...
This paper aims to empirically analyze the esthetics for user-sketched layouts of clustered graphs w...
Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the...
Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the inter...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
In evaluating aesthetics of graph drawings, recent works have provided participants with an adjacenc...
Many automatic graph layout algorithms have been designed and implemented to display relational data...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
Many automatic graph layout algorithms have been implemented to display relational data in a graphic...
A large class of diagrams can be informally characterized as node–link diagrams. Typically nodes rep...
AbstractThe research presented in this paper compares user-generated and automatic graph layouts. Fo...
Information visualisation systems which generate diagrams representing discrete relational informati...
The merit of automatic graph layout algorithms is typically judged on their computational efficiency...
The merit of automatic graph layout algorithms is typically judged on their computational efficiency...
The merit of automatic graph layout algorithms is typically judged on their computational effciency ...
This paper aims to empirically analyze the esthetics for user-sketched layouts of clustered graphs w...
Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the...
Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the inter...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
In evaluating aesthetics of graph drawings, recent works have provided participants with an adjacenc...
Many automatic graph layout algorithms have been designed and implemented to display relational data...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
Many automatic graph layout algorithms have been implemented to display relational data in a graphic...
A large class of diagrams can be informally characterized as node–link diagrams. Typically nodes rep...
AbstractThe research presented in this paper compares user-generated and automatic graph layouts. Fo...
Information visualisation systems which generate diagrams representing discrete relational informati...
The merit of automatic graph layout algorithms is typically judged on their computational efficiency...
The merit of automatic graph layout algorithms is typically judged on their computational efficiency...
The merit of automatic graph layout algorithms is typically judged on their computational effciency ...
This paper aims to empirically analyze the esthetics for user-sketched layouts of clustered graphs w...