License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.171
URN: urn:nbn:de:0030-drops-51390
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5139/
Go to the corresponding LIPIcs Volume Portal

Cardinal, Jean ; Hoffmann, Udo

Recognition and Complexity of Point Visibility Graphs

pdf-format:
56.pdf (0.6 MB)

Abstract

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 Mnev 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 having integer coordinates.

BibTeX - Entry

@InProceedings{cardinal_et_al:LIPIcs:2015:5139,
  author =	{Jean Cardinal and Udo Hoffmann},
  title =	{{Recognition and Complexity of Point Visibility Graphs}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{171--185},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5139},
  URN =		{urn:nbn:de:0030-drops-51390},
  doi =		{10.4230/LIPIcs.SOCG.2015.171},
  annote =	{Keywords: point visibility graphs, recognition, existential theory of the reals}
}

Keywords: point visibility graphs, recognition, existential theory of the reals
Collection: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 12.06.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI