140
click to vote
GD
15 years 10 months ago
2007 Springer 
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
132
click to vote
GD
15 years 10 months ago
2007 Springer 
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
135
click to vote
GD
15 years 10 months ago
2007 Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
114
click to vote
GD
15 years 10 months ago
2007 Springer
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
|
Computer Graphics