Name
Abstract | ||
|---|---|---|
Trees are usually drawn planar, i.e. without any crossings. In this paper, we investigate the area requirement of (non-upward) planar straight-line grid drawings of binary trees. Let T be a binary tree with n nodes. We show that T admits a planar straight-line grid drawing with area O(n) and with any pre-specified aspect ratio in the range [1, n驴], where 驴 is a constant such that 0 驴 驴 O(n log n) time. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-36151-0_30 | Journal of Graph Algorithms and Applications |
Keywords | DocType | Volume |
n node,linear area,pre-specified aspect ratio,binary tree,straight-line drawings,area requirement,n log n,binary trees,arbitrary aspect ratio,area o,planar straight-line grid drawing,aspect ratio | Conference | 8 |
Issue | ISBN | Citations |
2 | 3-540-00158-1 | 19 |
PageRank | References | Authors |
1.21 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ashim Garg | 1 | 494 | 36.84 |
| Adrian Rusu | 2 | 82 | 10.65 |