Relevance of graph-drawing algorithms to graph-based interfaces

Authors:
Bertrand Ibrahim;Honitriniela Randriamparany;Hidenori Yoshizumi
Affiliations:
Computer Science Department, University of Geneva, Switzerland;Computer Science Department, University of Geneva, Switzerland;Computer Science Department, University of Geneva, Switzerland
Venue:
AVI '00 Proceedings of the working conference on Advanced visual interfaces
Year:
2000

Citing 9
Cited 0

A Layout algorithm for data flow diagrams

IEEE Transactions on Software Engineering
Advances in graph drawing

CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
Maple-opt: a simultaneous technology mapping, placement, and global routing algorithm FPGAs with performance optimization

ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
Graph drawing

Handbook of discrete and computational geometry
On Improving Orthogonal Drawings: The 4M-Algorithm

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Diagrammatic Representation of Data Types and Data Manipulations in a Combined Data- and Control-Flow Language

VL '98 Proceedings of the IEEE Symposium on Visual Languages
Solving the Spaghetti Plate Syndrome in a Control-Flow Language with a VLSI-Like Solution

VL '99 Proceedings of the IEEE Symposium on Visual Languages
A Framework for Dynamic Graph Drawing

A Framework for Dynamic Graph Drawing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The visual interface plays a significant role in a visual programming system. We therefore developed heuristics that improve the readability of control- and data-flow diagrams with many hundreds, and even thousands of nodes. In this paper, we study how the body of research in graph drawing (GD) can be applied to an actual graph-based interface.