Recognition and Complexity of Point Visibility Graphs
- 168 Downloads
A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open segment between them does not contain any other point of the set. We study the recognition problem for point visibility graphs: Given a simple undirected graph, decide whether it is the visibility graph of some point set in the plane. We show that the problem is complete for the existential theory of the reals. Hence the problem is as hard as deciding the existence of a real solution to a system of polynomial inequalities. The proof involves simple substructures forcing collinearities in all realizations of some visibility graphs, which are applied to the algebraic universality constructions of Mnëv and Richter-Gebert. This solves a longstanding open question and paves the way for the analysis of other classes of visibility graphs. Furthermore, as a corollary of one of our construction, we show that there exist point visibility graphs that do not admit any geometric realization with points on a grid. We also prove that the problem of recognizing visibility graphs of points on a grid is decidable if and only if the existential theory of the rationals is decidable.
KeywordsPoint visibility graphs Existential theory of the reals Geometric graph representations
We thank an anonymous SoCG referee for pointing out an error in the original proof.We also thank the anonymous DCG referee for his numerous suggestions, which helped to simplify the constructions significantly compared to the conference version. J. Cardinal is supported by the ARC (Action de Recherche Concertée) project COPHYMA. U. Hoffmann is supported by the Deutsche Forschungsgemeinschaft within the research training group ’Methods for Discrete Structures’ (GRK 1408).
- 5.Canny, J.: Some algebraic and geometric computations in PSPACE. In: STOC, pp. 460–467. ACM, New York (1988)Google Scholar
- 10.Ghosh, S.K., Roy, B.: Some results on point visibility graphs. In: WALCOM. LNCS, vol. 8344, pp. 163–175. Springer, Berlin (2014)Google Scholar
- 12.Grünbaum, B.: Arrangements and Spreads. Regional Conference Series in Mathematics, vol. 10. AMS, Providence, RI (1972)Google Scholar
- 13.Grünbaum, B.: Convex Polytopes. Graduate Texts in Mathematics, vol. 221, 2nd edn. Springer, New York (2003)Google Scholar
- 21.Mnëv, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Topology and Geometry—Rohlin Seminar. LNM, pp. 527–543. Springer, Berlin (1988)Google Scholar
- 23.O’Rourke, J., Streinu, I.: Vertex-edge pseudo-visibility graphs: characterization and recognition. In: SoCG, pp. 119–128. ACM, New York (1997)Google Scholar
- 26.Roy, B.: Point visibility graph recognition is NP-hard. arXiv:1406.2428 (2014)
- 27.Schaefer, M.: Complexity of some geometric and topological problems. In: GD, LNCS, vol. 5849, pp. 334–344. Springer, Berlin (2009)Google Scholar
- 28.Schaefer, M.: Realizability of graphs and linkages. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer, Berlin (2012)Google Scholar
- 30.Staudt, K.G.C.: Geometrie der Lage. F. Korn, Nuremberg (1847)Google Scholar