Sciweavers

119
Voted
GD
1995
Springer
15 years 4 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
114
Voted
GD
1995
Springer
15 years 4 months ago
Incremental Layout in DynaDAG
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
Stephen C. North
98
Voted
GD
1995
Springer
15 years 4 months ago
On Representations of Some Thickness-Two Graphs
This paper considers representations of graphs as rectangle-visibility graphs and as doubly linear graphs. These are, respectively, graphs whose vertices are isothetic rectangles ...
Joan P. Hutchinson, Thomas C. Shermer, Andrew Vinc...
93
Voted
GD
1995
Springer
15 years 4 months ago
Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
86
Voted
GD
1995
Springer
15 years 4 months ago
Graph Layout Adjustment Strategies
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...
Margaret-Anne D. Storey, Hausi A. Müller
Computer Graphics
Top of PageReset Settings