Results 1  10
of
18
Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections
, 2001
"... We propose a novel visualization approach that facilitates graphical exploration and communication of relative actor status in social networks. The main idea is to map, in a drawing of the entire network, actor status scores to vertical coordinates. The resulting problem of determining horizonta ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
We propose a novel visualization approach that facilitates graphical exploration and communication of relative actor status in social networks. The main idea is to map, in a drawing of the entire network, actor status scores to vertical coordinates. The resulting problem of determining horizontal positions of actors and routing of connecting lines such that the overall layout is readable is algorithmically difficult, yet wellstudied in the literature on graph drawing. We outline a customized approach. The advantages
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
, 2007
"... In radial drawings of hierarchical graphs the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outwards monotone segments of spirals rather than straight lines as it is both done in the standard Sugiyama framework. This drawing style is well suite ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
In radial drawings of hierarchical graphs the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outwards monotone segments of spirals rather than straight lines as it is both done in the standard Sugiyama framework. This drawing style is well suited for the visualisation of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results this reduces the number of crossings by approximately 30 percent on average. Few crossings are one of the major criteria for human readability. This paper is a detailed description of a complete framework for visualizing hierarchical information in a new radial fashion. Particularly, we briefly cover extensions of the level assignment step to benefit by the increasing perimeters of the circles, present three heuristics for crossing reduction in radial level drawings, and also show how to visualize the results.
GEOMI: GEOmetry for Maximum Insight
 In GD05: 13th International Symposium on Graph Drawing
, 2005
"... Abstract. This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis methods, graph layout algorithms and several graph navigation and interaction methods. GEOMI is a new generation ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
Abstract. This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis methods, graph layout algorithms and several graph navigation and interaction methods. GEOMI is a new generation of visual analysis tools combining graph visualisation techniques with network analysis methods. GEOMI is available from
An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing
 JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS
, 2005
"... Sugiyama’s algorithm for layered graph drawing is very popular and commonly used in practical software. The extensive use of dummy vertices to break long edges between nonadjacent layers often leads to unsatisfying performance. The worstcase runningtime of Sugiyama’s approach is O(V E  log E ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Sugiyama’s algorithm for layered graph drawing is very popular and commonly used in practical software. The extensive use of dummy vertices to break long edges between nonadjacent layers often leads to unsatisfying performance. The worstcase runningtime of Sugiyama’s approach is O(V E  log E) requiring O(V E) memory, which makes it unusable for the visualization of large graphs. By a conceptually simple new technique we are able to keep the number of dummy vertices and edges linear in the size of the graph without increasing the number of crossings. We reduce the worstcase time complexity of Sugiyama’s approach by an order of magnitude to O((V  + E) log E) requiring O(V  + E) space.
Upward Planarization Layout
, 2011
"... Recently, we presented a new practical method for upward crossing minimization [8], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a planarly embedded graph in which crossings are re ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Recently, we presented a new practical method for upward crossing minimization [8], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a planarly embedded graph in which crossings are represented by dummy vertices. However, straightforward approaches for drawing such UPRs lead to quite unsatisfactory results. In this paper, we present a new algorithm for drawing UPRs that greatly improves the layout quality, leading to good hierarchal drawings with few crossings. We analyze its performance on wellknown benchmark graphs and compare it with alternative approaches.
Radial coordinate assignment for level graphs
 Proc. Computing and Combinatorics, COCOON 2005, volume 3595 of LNCS
, 2005
"... Abstract. We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing the vertex ordering, and therefore without introducing new edge crossings. Edges are drawn as sequences of sp ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing the vertex ordering, and therefore without introducing new edge crossings. Edges are drawn as sequences of spiral segments with at most two bends. 1
Drawing graphs with glee
, 2007
"... Abstract. This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edgecrossings counting while performing adjacent verte ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edgecrossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm. 1
Hierarchical layouts of directed graphs in three dimensions
 GRAPH DRAWING: PROCEEDINGS OF 13TH INTERNATIONAL SYMPOSIUM, GD 2005, VOLUME 3843 OF LNCS
, 2005
"... We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel planes. The vertex set is further partitioned into k ≥ 2 subsets, called walls. The layout consists of a set of parallel walls which ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel planes. The vertex set is further partitioned into k ≥ 2 subsets, called walls. The layout consists of a set of parallel walls which are perpendicular to the set of parallel planes of the layers. We also outline a method for computing such layouts and introduce four alternative algorithms for partitioning the vertex set into walls which address different aesthetic requirements.
Coordinate Assignment for Cyclic Level Graphs
"... The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. g., distinguished cycles in the biosciences and scheduling processes which repeat in a daily or weekly turn. This excludes the removal of cycles. In their seminal paper Sugiyama et al. introduced recurrent hierarchies as a concept to draw graphs with cycles. However, this concept has not received much attention in the following years. In this paper we supplement our cyclic Sugiyama framework and investigate the coordinate assignment phase. We provide an algorithm which runs in linear time and constructs drawings which have at most two bends per edge and use quadratic area.