# The Complexity of Drawing a Graph in a Polygonal Region

We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to create a planar straight-line drawing of the graph inside the region. This strengthens an NP-hardness result by Patrignani on extending partial planar graph drawings. Our result is one of the first showing that a problem of drawing planar graphs with straight-line edges is hard for the existential theory of the reals. The complexity of the problem is open in the case of a simply connected region. We also show that, even for integer input coordinates, it is possible that drawing a graph in a polygonal region requires some vertices to be placed at irrational coordinates. By contrast, the coordinates are known to be bounded in the special case of a convex region, or for drawing a path in any polygonal region.

• 24 publications
• 26 publications
• 32 publications
research
08/21/2018

### Monotone Drawings of k-Inner Planar Graphs

A k-inner planar graph is a planar graph that has a plane drawing with a...
research
02/18/2019

### Extending Upward Planar Graph Drawings

In this paper we study the computational complexity of the Upward Planar...
research
08/24/2017

### Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity

We introduce and study the problem Ordered Level Planarity which asks fo...
research
03/20/2019

### Z_2-genus of graphs and minimum rank of partial symmetric matrices

The genus g(G) of a graph G is the minimum g such that G has an embeddin...
research
06/29/2018

### (k,p)-Planarity: A Generalization of Hybrid Planarity

A graph G is (k,p)-planar if its vertices can be partitioned into cluste...
research
06/29/2018

### (k,p)-Planarity: A Relaxation of Hybrid Planarity

We present a new model for hybrid planarity that relaxes existing hybrid...
research
01/21/2014

### Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs

Graph drawing addresses the problem of finding a layout of a graph that ...