436 search results - page 9 / 88 » Lombardi Drawings of Graphs |
GD
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parame...
COMGEO
2007
ACM
13 years 9 months ago
2007
ACM
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
GD
2004
Springer
14 years 3 months ago
2004
Springer
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
GD
2006
Springer
14 years 1 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,...
CGVR
2008
13 years 11 months ago
2008
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...