Recognition and Complexity of Point Visibility Graphs

详细信息    查看全文

• 作者：Jean Cardinal ; Udo Hoffmann
• 关键词：Point visibility graphs ; Existential theory of the reals ; Geometric graph representations
• 刊名：Discrete & Computational Geometry
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：57
• 期：1
• 页码：164-178
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Combinatorics; Computational Mathematics and Numerical Analysis;
• 出版者：Springer US
• ISSN：1432-0444
• 卷排序：57

文摘

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.