# Complexity of Finding Non-Planar Rectilinear Drawings of Graphs

@inproceedings{Manuch2010ComplexityOF,
title={Complexity of Finding Non-Planar Rectilinear Drawings of Graphs},
author={J{\'a}n Manuch and Murray D. Patterson and Sheung-Hung Poon and Chris Thachuk},
booktitle={Graph Drawing},
year={2010}
}
• Published in Graph Drawing 21 September 2010
• Mathematics
We study the complexity of the problem of finding non-planar rectilinear drawings of graphs. This problem is known to be NP-complete. We consider natural restrictions of this problem where constraints are placed on the possible orientations of edges. In particular, we show that if each edge has prescribed direction "left", "right", "down" or "up", the problem of finding a rectilinear drawing is polynomial, while finding such a drawing with the minimum area is NP-complete. When assigned…

### On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

• Mathematics
Algorithmica
• 2018
Two variants of the well-known orthogonal drawing model are studied: the smooth orthogonic, and the octilinear, both of which form an extension of the Orthogonal by supporting one additional type of edge segments.

### Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs

Galoois theory is used to show that many variants of graph drawing problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials, hence, such solutions cannot be computed exactly even in extended computational models that include such operations.

### On the Complexity of HV-rectilinear Planarity Testing

• Mathematics
Graph Drawing
• 2014
It is proved that HV-rectilinear planarity testing is NP-complete even for graphs having vertex degree at most three, which solves an open problem posed by both Manuch et al.

### Drawing HV-Restricted Planar Graphs

• Mathematics
LATIN
• 2014
This paper gives a polynomial-time algorithm to check whether a given HV-restricted plane graph admits a good orthogonal drawing preserving the input embedding, which settles an open question posed by Maňuch, Patterson, Poon and Thachuk (GD 2010).

### Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings

• Computer Science
Graph Drawing
• 2011
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows or the minimum possible area cannot be approximated to within better than a polynomial factor

### Combinatorial Properties and Recognition of Unit Square Visibility Graphs

• Mathematics
MFCS
• 2017
This work investigates combinatorial properties of these graph classes and the hardness of variants of the recognition problem, i.e., the problem of representing USGV with fixed visibilities within small area and, for USV, the general recognition problem.

### Inapproximability of Orthogonal Compaction

• Computer Science
J. Graph Algorithms Appl.
• 2012
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a

### Orthogonal-Ordering Constraints are Tough Ulrik Brandes

We show that rectilinear graph drawing, the core problem of bendminimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for

### Orthogonal-Ordering Constraints are Tough

• Computer Science
J. Graph Algorithms Appl.
• 2013
It is shown that rectilinear graph drawing and uniform edge-length drawing, the core problem of bendminimum orthogonal graph drawing, are NP-hard even for embedded paths if subjected to Orthogonal-ordering constraints.