2 research outputs found
The Complexity of Simultaneous Geometric Graph Embedding
Given a collection of planar graphs on the same set of
vertices, the simultaneous geometric embedding (with mapping) problem, or
simply -SGE, is to find a set of points in the plane and a bijection
such that the induced straight-line drawings of
under are all plane.
This problem is polynomial-time equivalent to weak rectilinear realizability
of abstract topological graphs, which Kyn\v{c}l (doi:10.1007/s00454-010-9320-x)
proved to be complete for , the existential theory of the
reals. Hence the problem -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
-SGE, with the property that both numbers and are linear in the
number of pseudolines. This implies not only the -hardness
result, but also a 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\v{c}l's proof is
only