1265 search results - page 16 / 253 » Algorithms for Drawing Media |
GD
2006
Springer
14 years 3 days 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,...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
ASIAN
2007
Springer
14 years 2 months ago
2007
Springer
CG
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. Whi...
JDA
2010
13 years 6 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...