8 search results - page 1 / 2 » Topology Preserving Constrained Graph Layout |
GD
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
GD
2008
Springer
13 years 5 months ago
2008
Springer
We present a new network diagram authoring tool, Dunnart, that provides continuous network layout. It continuously adjusts the layout in response to user interaction, while still m...
TVCG
2008
13 years 4 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
GD
2009
Springer
13 years 8 months ago
2009
Springer
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
GD
1995
Springer
13 years 8 months ago
1995
Springer
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...