431 search results - page 49 / 87 » Bold Graph Drawings |
GD
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
GD
1998
Springer
15 years 3 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 3 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
15 years 5 days 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 11 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 ...