The complexity of minimizing wire lengths in VLSI layouts
Information Processing Letters
Unit-length embedding of binary trees on a square grid
Information Processing Letters
A node-positioning algorithm for general trees
Software—Practice & Experience
A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry: Theory and Applications
Aesthetic layout of generalized trees
Software—Practice & Experience
The logic engine and the realization problem for nearest neighbor graphs
Theoretical Computer Science - Special issue on theoretical computer science in Australia and New Zealand
Area-efficient algorithms for straight-line tree drawings
Computational Geometry: Theory and Applications
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
Computational Geometry: Theory and Applications
Nice drawings of graphs are computationally hard
Selected Contributions from the on 7th Interdisciplinary Workshop on Informatics and Psychology: Visualization in Human-Computer Interaction
Improving Walker's Algorithm to Run in Linear Time
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
IEEE Transactions on Software Engineering
Tree Drawings on the Hexagonal Grid
Graph Drawing
Straight-line orthogonal drawings of binary and ternary trees
GD'07 Proceedings of the 15th international conference on Graph drawing
Universality considerations in VLSI circuits
IEEE Transactions on Computers
Drawing ordered (k - 1)-ary trees on k-grids
GD'10 Proceedings of the 18th international conference on Graph drawing
| Hi-index | 0.00 |
We present almost linear area bounds for drawing complete trees on the octagonal grid. For 7-ary trees we establish an upper and lower bound of Θ(n1.129) and for ternary trees the bounds of $\O(n^{1.048})$ and Θ(n), where the latter needs edge bends. We explore the unit edge length and area complexity of drawing unordered trees on k-grids with k∈{4, 6, 8} and generalize the $\mathcal{NP}$-hardness results of the orthogonal and hexagonal grid to the octagonal grid.