Cologne Excellence Cluster on Cellular Stress Responses in Aging Associated Diseases
Graph Drawing E-print ArchiveNot a member yet
1225 research outputs found
Sort by
More Flexible Radial Layout
No full textWe describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to the circumferences of a set of concentric circles around the origin. Such constraints frequently occur in the layout of social or policy networks, when structural centrality is mapped to geometric centrality, or when the primary intention of the layout is the display of the vicinity of a distinguished node. We extend stress majorization by a weighting scheme which imposes radial constraints on the layout but also tries to preserve as much information about the graph structure as possible
Planar Drawings of Higher-Genus Graphs
No full textIn this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R2 , with a bounding face defined by a polygonal schema P for S. Our drawings are planar, but they allow for multiple copies of vertices and edges on P’s boundary, which is a common way of visualizing higher-genus graphs in the plane. As a side note, we show that it is NP-complete to determine whether a given graph embedded in a genus-g surface has a set of 2g fundamental cycles with vertex-disjoint interiors, which would be desirable from a graph-drawing perspective
Orthogonal Connector Routing
No full textOrthogonal connectors are used in a variety of common network diagrams. Most interactive diagram editors provide orthogonal connectors with some form of automatic connector routing. However, these tools use ad-hoc heuristics that can lead to strange routes and even routes that pass through other objects. We present an algorithm for computing optimal object-avoiding orthogonal connector routings where the route minimizes a monotonic function of the connector length and number of bends. The algorithm is efficient and can calculate connector routings fast enough to reroute connectors during interaction
Graph Drawing Contest Report
No full textThis report describes the 16th Annual Graph Drawing Contest, held in conjunction with the 2009 Graph Drawing Symposium in Chicago, USA. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology
A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View
No full textThe universe of biochemical reactions in metabolic pathways can be modeled as a complex network structure augmented with domain specific annotations. Based on the functional properties of the involved reactions, metabolic networks are often clustered into so-called pathways inferred from expert knowledge. To support the domain expert in the exploration and analysis process, we follow the well-known Table Lens metaphor with the possibility to select multiple foci. In this paper, we introduce a novel approach to generate an interactive layout of such a metabolic network taking its hierarchical structure into account and present methods for navigation and exploration that preserve the mental map. The layout places the network nodes on a fixed rectilinear grid and routes the edges orthogonally between the node positions. Our approach supports bundled edge routes heuristically minimizing a given cost function based on the number of bends, the number of edge crossings and the density of edges within a bundle
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
No full textIn this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, Θ(n2 ) is the established upper and lower bound on the worst-case area. It is a long-standing open problem for what graphs smaller area can be achieved, with results known only for trees and outer-planar graphs. We show here that series-parallel can be drawn in O(n3/2 ) area, but 2-outer-planar graphs and planar graphs of proper pathwidth 3 require Ω(n2 ) area