The Complexity of Simultaneous Geometric Graph Embedding

02/28/2013
by   Jean Cardinal, et al.
0

Given a collection of planar graphs G_1,...,G_k on the same set V of n vertices, the simultaneous geometric embedding (with mapping) problem, or simply k-SGE, is to find a set P of n points in the plane and a bijection ϕ: V → P such that the induced straight-line drawings of G_1,...,G_k under ϕ are all plane. This problem is polynomial-time equivalent to weak rectilinear realizability of abstract topological graphs, which Kynčl (doi:10.1007/s00454-010-9320-x) proved to be complete for ∃R, the existential theory of the reals. Hence the problem k-SGE is polynomial-time equivalent to several other problems in computational geometry, such as recognizing intersection graphs of line segments or finding the rectilinear crossing number of a graph. We give an elementary reduction from the pseudoline stretchability problem to k-SGE, with the property that both numbers k and n are linear in the number of pseudolines. This implies not only the ∃R-hardness result, but also a 2^2^Ω (n) lower bound on the minimum size of a grid on which any such simultaneous embedding can be drawn. This bound is tight. Hence there exists such collections of graphs that can be simultaneously embedded, but every simultaneous drawing requires an exponential number of bits per coordinates. The best value that can be extracted from Kynčl's proof is only 2^2^Ω (√(n)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2023

An exponential bound for simultaneous embeddings of planar graphs

We show that there are O(n · 4^n/11) planar graphs on n vertices which d...
research
08/05/2021

Geometric Embeddability of Complexes is ∃ℝ-complete

We show that the decision problem of determining whether a given (abstra...
research
12/01/2017

On the Simultaneous Minimum Spanning Trees Problem

Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given ...
research
11/15/2018

A Note On Universal Point Sets for Planar Graphs

We investigate which planar point sets allow simultaneous straight-line ...
research
09/08/2017

Balanced Line Separators of Unit Disk Graphs

We prove a geometric version of the graph separator theorem for the unit...
research
07/08/2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

The problem of extending partial geometric graph representations such as...
research
12/20/2017

Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors

Suppose we have an arrangement A of n geometric objects x_1, ..., x_n ⊆R...

Please sign up or login with your details

Forgot password? Click here to reset