Drawing ordered (k - 1)-ary trees on k-grids

Authors:
Wolfgang Brunner;Marco Matzeder
Affiliations:
University of Passau, Passau, Germany;University of Passau, Passau, Germany
Venue:
GD'10 Proceedings of the 18th international conference on Graph drawing
Year:
2010

Citing 14
Cited 1

The complexity of minimizing wire lengths in VLSI layouts

Information Processing Letters
On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
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
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
Optimizing area and aspect ratio in straight-line orthogonal tree drawings

Computational Geometry: Theory and Applications
Hexagonal Grid Drawings

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
On the complexity of drawing trees nicely: corrigendum

Acta Informatica
Tidier Drawings of Trees

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
Hexagonal grid drawings: algorithms and lower bounds

GD'04 Proceedings of the 12th international conference on Graph Drawing
Gravisto: graph visualization toolkit

GD'04 Proceedings of the 12th international conference on Graph Drawing

Drawing unordered trees on k-grids

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the complexity of drawing ordered (k - 1)-ary trees on grids with k directions for k ∈ {4, 6, 8} and within a given area. This includes, e. g., ternary trees drawn on the orthogonal grid. For aesthetically pleasing tree drawings on these grids, we additionally present various restrictions similar to the common hierarchical case. First, we generalize the NP-hardness of minimal width in hierarchical drawings of ordered trees to (k - 1)-ary trees on k-grids and then we generalize the Reingold and Tilford algorithm to k-grids.