10 search results - page 1 / 2 » On Balloon Drawings of Rooted Trees |
GD
2005
Springer
14 years 4 months ago
2005
Springer
IV
2005
IEEE
14 years 4 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
IPL
2002
13 years 10 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
ICCS
2004
Springer
14 years 4 months ago
2004
Springer
We present an incremental tree editor based on algorithms for manipulating shape functions. The tree layout is hierarchical, left-to-right. Nodes of variable size and shape are sup...
GD
2005
Springer
14 years 4 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 ...