This paper proposes a multidrawing approach to graph drawing. Current graph-drawing systems typically produce only one drawing of a graph. By contrast, the multidrawing approach calls for systematically producing many drawings of the same graph, where the drawings presented to the user represent a balance between aesthetics and diversity. This addresses a fundamental problem in graph drawing, namely, how to avoid requiring the user to specify formally and precisely all the characteristics of a single "nice" drawing. We present a proof-of-concept implementation with which we produce diverse selections of symmetriclooking drawings for small graphs
AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and ...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straig...
This paper proposes a multidrawing approach to graph drawing. Current graph-drawing systems typicall...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
Introduction. Graph drawing algorithms developed over the past 30 years aim to produce “readable” p...
The visual complexity of a graph drawing is defined as the number of geometric objects needed to rep...
In evaluating aesthetics of graph drawings, recent works have provided participants with an adjacenc...
The visual complexity of a graph drawing is defined as the number of geometric objects needed to rep...
Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the inter...
Our world is full of networks. The linking relationships might be quite abstract, such as friendship...
Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the...
This article we address the general problem of drawing nice-looking undirected straight-line graphs....
AbstractWe describe a multi-scale approach to the problem of drawing undirected graphs “nicely”, wit...
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimizing the num...
AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and ...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straig...
This paper proposes a multidrawing approach to graph drawing. Current graph-drawing systems typicall...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
Introduction. Graph drawing algorithms developed over the past 30 years aim to produce “readable” p...
The visual complexity of a graph drawing is defined as the number of geometric objects needed to rep...
In evaluating aesthetics of graph drawings, recent works have provided participants with an adjacenc...
The visual complexity of a graph drawing is defined as the number of geometric objects needed to rep...
Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the inter...
Our world is full of networks. The linking relationships might be quite abstract, such as friendship...
Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the...
This article we address the general problem of drawing nice-looking undirected straight-line graphs....
AbstractWe describe a multi-scale approach to the problem of drawing undirected graphs “nicely”, wit...
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimizing the num...
AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and ...
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts t...
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straig...