137
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
114
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
127
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
100
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
120
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer