Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10807)

Abstract

Suppose we have an arrangement \(\mathcal {A}\) of n geometric objects \(x_1, \dots , x_n \subseteq \mathbb {R}^2\) in the plane, with a distinguished point \(p_i\) in each object \(x_i\). The generalized transmission graph of \(\mathcal {A}\) has vertex set \(\{x_1, \dots , x_n\}\) and a directed edge \(x_ix_j\) if and only if \(p_j \in x_i\). Generalized transmission graphs provide a generalized model of the connectivity in networks of directional antennas.

The complexity class \(\exists \mathbb {R}\) contains all problems that can be reduced in polynomial time to an existential sentence of the form \(\exists x_1, \dots , x_n: \phi (x_1,\dots , x_n)\), where \(x_1,\dots , x_n\) range over \(\mathbb {R}\) and \(\phi \) is a propositional formula with signature \((+, -, \cdot , 0, 1)\). The class \(\exists \mathbb {R}\) aims to capture the complexity of the existential theory of the reals. It lies between \(\mathbf {NP}\) and \(\mathbf {PSPACE}\).

Many geometric decision problems, such as recognition of disk graphs and of intersection graphs of lines, are complete for \(\exists \mathbb {R}\). Continuing this line of research, we show that the recognition problem of generalized transmission graphs of line segments and of circular sectors is hard for \(\exists \mathbb {R}\). As far as we know, this constitutes the first such result for a class of directed graphs.

Notes

Acknowledgments

We would like to thank an anonymous reviewer for pointing out a mistake in Observation 4.1.

References

  1. 1.
    Kang, R.J., Müller, T.: Sphere and dot product representations of graphs. Discret. Comput. Geom. 47(3), 548–568 (2012)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Spanners and reachability Oracles for directed transmission graphs. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG), pp. 156–170 (2015)Google Scholar
  3. 3.
    Klost, K.: Complexity of recognizing generalized transmission graphs, March 2017. http://www.mi.fu-berlin.de/inf/groups/ag-ti/theses/download/Klost17.pdf
  4. 4.
    Knuth, D.E.: Axioms and Hulls. LNCS, vol. 606. Springer, Heidelberg (1992).  https://doi.org/10.1007/3-540-55611-7 MATHGoogle Scholar
  5. 5.
    Matoušek, J.: Intersection graphs of segments and \(\exists \mathbb{R}\) (2014). arXiv:1406.2636
  6. 6.
    Mnëv, N.E.: Realizability of combinatorial types of convex polyhedra over fields. J. Sov. Math. 28(4), 606–609 (1985)CrossRefMATHGoogle Scholar
  7. 7.
    Schaefer, M.: Complexity of some geometric and topological problems. In: Proceeding of the 17th International Symposium on Graph Drawing (GD), pp. 334–344 (2009)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Institut für InformatikFreie Universität BerlinBerlinGermany

Personalised recommendations