Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the interpretation of existing graph drawings. We report on experiments which focus on the creation and layout of graph drawings: participants were asked to draw graphs based on adjacency lists, and to lay them out ‘nicely’. Two interaction methods were used for creating the drawings: a sketch interface which allows for easy, natural hand-movements, and a formal point-and-click interface similar to a typical graph editing system. 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. We observe that the...
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 ...
A large class of diagrams can be informally characterized as node–link diagrams. Typically nodes rep...
Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
Many automatic graph layout algorithms have been designed and implemented to display relational data...
AbstractThe research presented in this paper compares user-generated and automatic graph layouts. Fo...
Many automatic graph layout algorithms have been implemented to display relational data in a graphic...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
In evaluating aesthetics of graph drawings, recent works have provided participants with an adjacenc...
Information visualisation systems which generate diagrams representing discrete relational informati...
Information visualisation systems which generate diagrams representing discrete relational infor-mat...
We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on...
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 ...
A large class of diagrams can be informally characterized as node–link diagrams. Typically nodes rep...
Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
Many automatic graph layout algorithms have been designed and implemented to display relational data...
AbstractThe research presented in this paper compares user-generated and automatic graph layouts. Fo...
Many automatic graph layout algorithms have been implemented to display relational data in a graphic...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
In evaluating aesthetics of graph drawings, recent works have provided participants with an adjacenc...
Information visualisation systems which generate diagrams representing discrete relational informati...
Information visualisation systems which generate diagrams representing discrete relational infor-mat...
We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on...
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 ...
A large class of diagrams can be informally characterized as node–link diagrams. Typically nodes rep...