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
An Investigation of Algorithms to Aesthetically Draw Cayley Graphs
Get PDFGraph visualisation is an important field in Computer Science. The
visualisation of groups in the form of Cayley graphs has applications in the
layout of interconnected networks and mathematics. By using theoretical
results from group theory, we present two algorithms that take as input a
Cayley graph and draws it in a layout that highlights the symmetry
of the group and is easily readable
Visualizing Internet Evolution on the Autonomous Systems Level
No full textWe propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of representation in a single-level visualization rather than abstractions of lower levels of detail. This is useful for non-interactive display and eases dynamic layout, which we address in the online scenario.
Our approach is illustrated on a family of large networks featuring all of the above structural characteristics, the physical Internet on the autonomous systems level over time
Minimum Level Nonplanar Patterns for Trees
No full textMinimum lvel nonplanar (MLNP) patterns play the role for level planar graphs that the forbidden Kuratowksi subdivisions and play for planar graphs. We add two MLNP patterns for trees to the previous set of tree patterns given by Healy [4]. Neither of these patterns match any of the previous patterns. We show that this new set of patterns completely characterizes level planar trees
An Algorithm to Construct Greedy Drawings of Triangulations
No full textWe show an algorithm to construct greedy drawings of every given triangulation
The Algorithmic Beauty of Digital Nature
No full textIn recent years the development of graphics hardware and efficient
rendering algorithms enabled game developers to create large
landscapes and render them at interactive rates. However, the shown
scenes are still rough approximations that do not reach the
complexity of real nature. To obtain sufficient simulations with a
degree of realism that comes close to nature, a couple of problems
have to be solved. In this extended abstract these challenges are
roughly sketched, references are given for further readings
The Number of Triangulations on Planar Point Sets
No full textWe give a brief account of results concerning the number of
triangulations on finite point sets in the plane, both for
arbitrary sets and for specific sets
such as the n x n integer lattice
Parameterized st-Orientations of Graphs: Algorithms and Experiments
No full textst-orientations (st-numberings) or bipolar orientations of
undirected graphs are central to many graph algorithms and
applications. Several algorithms have been proposed in the past to
compute an st-orientation of a biconnected graph. However, as
indicated in [1], the computation of more than one
st-orientation is very important for many applications in multiple
research areas, such as this of Graph Drawing. In this paper we show
how to compute such orientations with certain (parameterized)
characteristics in the final st-oriented graph, such as the length
of the longest path. Apart from Graph Drawing, this work applies in
other areas such as Network Routing and in tackling difficult
problems such as Graph Coloring and Longest Path. We present primary
approaches to the problem of computing longest path parameterized
st-orientations of graphs, an analytical presentation (together
with proof of correctness) of a new ( for
planar graphs) time algorithm that computes such orientations (and
which was used in [1]) and extensive computational
results that reveal the robustness of the algorithm
Choosing Colors for Geometric Graphs via Color Space Embeddings
No full textGraph drawing research traditionally focuses on
producing geometric embeddings of graphs
satisfying various aesthetic constraints.
After the geometric embedding is specified, there is an additional step
that is often overlooked or ignored:
assigning display colors to the graph's vertices.
We study
the additional aesthetic criterion of assigning distinct colors to
vertices of a geometric graph
so that the colors assigned to adjacent vertices are as
different from one another as possible.
We formulate this as a problem involving perceptual metrics in color
space and we develop algorithms for solving this problem by
embedding the graph in color space.
We also present an application of this work to a distributed load-balancing
visualization problem
Controllable and Progressive Edge Clustering for Large Networks
No full textNode-link diagrams are widely used in information visualization to show relationships among data.
However, when the size of data becomes very large, node-link diagrams will become cluttered and visually confusing for users.
In this paper, we propose a novel controllable edge clustering method based on Delaunay triangulation to
reduce visual clutter for node-link diagrams.
Our method uses curves instead of straight lines to represent links and these curves can be grouped together
according to their relative positions and directions.
We further introduce progressive edge clustering to achieve continuous level-of-details for large networks
The Website for Graph Visualization Software References (GVSR)
No full textGraph drawing software are now commonly used. However, the choice of
a well-adapted program may be hard for an inexperienced user. This
poster presents a website (http://www.polytech.univ-nantes.fr/GVSR/)
built to help users choose a program adapted to their problems. So far,
this site uniformely presents fifty programs and aims at
helping users both in their choices and in comparing the programs