Skip to main content
Conference ProceedingsOPEN ACCESS

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6502 LNCS 105-116
DOI: 10.1007/978-3-642-18469-7_10
6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Brunner, W., & Matzeder, M. (2011). Drawing ordered (k - 1)-ary trees on k-grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 105–116). https://doi.org/10.1007/978-3-642-18469-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free