On Upward Drawings of Trees on a Given Grid

08/31/2017
by   Therese Biedl, et al.
0

Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known for straight-line drawings of trees under various restrictions such as edge length or slope constraints. On the other hand, there exist polynomial-time algorithms for computing minimum-width (resp., minimum-height) upward drawings of trees, where the height (resp., width) is unbounded. In this paper we take a major step in understanding the complexity of the area minimization problem for strictly-upward drawings of trees, which is one of the most common styles for drawing rooted trees. We prove that given a rooted tree T and a W× H grid, it is NP-hard to decide whether T admits a strictly-upward (unordered) drawing in the given grid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2021

Upward Planar Drawings with Three and More Slopes

We study upward planar straight-line drawings that use only a constant n...
research
02/28/2019

On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees

In this paper, we study the area requirements of planar straight-line or...
research
03/16/2022

Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals

We consider drawings of graphs in the plane in which vertices are assign...
research
08/15/2019

Homotopy height, grid-major height and graph-drawing height

It is well-known that both the pathwidth and the outer-planarity of a gr...
research
08/28/2021

Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths

We study a classic problem introduced thirty years ago by Eades and Worm...
research
07/31/2020

New Results in Sona Drawing: Hardness and TSP Separation

Given a set of point sites, a sona drawing is a single closed curve, dis...
research
08/12/2019

A Natural Quadratic Approach to the Generalized Graph Layering Problem

We propose a new exact approach to the generalized graph layering proble...

Please sign up or login with your details

Forgot password? Click here to reset