430 search results - page 51 / 86 » Drawing Graphs with GLEE |
GD
1998
Springer
15 years 2 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
GD
2009
Springer
15 years 2 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
APVIS
2009
14 years 11 months ago
2009
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
COGSCI
2010
14 years 10 months ago
2010
We used a new method to assess how people can infer unobserved causal structure from patterns of observed events. Participants were taught to draw causal graphs, and then shown a ...
DCG
2008
14 years 10 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...