ALGORITHMICA
2002
14 years 8 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
JGAA
2007
14 years 8 months ago
2007
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
61
Voted
COMGEO
2007
ACM
14 years 8 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-...
62
Voted
GD
2008
Springer
14 years 10 months ago
2008
Springer
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of dir...
75
Voted
GD
2004
Springer
15 years 2 months ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...