Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computational Geometry

arXiv:1503.07082 (cs)
[Submitted on 24 Mar 2015 (v1), last revised 4 Feb 2019 (this version, v2)]

Title:Recognition and Complexity of Point Visibility Graphs

Authors:Jean Cardinal, Udo Hoffmann
View PDF
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 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 having integer coordinates.
Comments: 14 pages, 6 figures
Subjects: Computational Geometry (cs.CG); Combinatorics (math.CO)
ACM classes: I.3.5; F.2.2
Cite as: arXiv:1503.07082 [cs.CG]
  (or arXiv:1503.07082v2 [cs.CG] for this version)
  https://doi.org/10.48550/arXiv.1503.07082
Journal reference: Discrete & Computational Geometry, January 2017, Volume 57, Issue 1, pp 164-178
Related DOI: https://doi.org/10.1007/s00454-016-9831-1

Submission history

From: Jean Cardinal [view email]
[v1] Tue, 24 Mar 2015 15:37:28 UTC (705 KB)
[v2] Mon, 4 Feb 2019 08:01:04 UTC (139 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.CG
< prev   |   next >
new | recent | 2015-03
Change to browse by:
cs
math
math.CO

References & Citations

1 blog link

(what is this?)

DBLP - CS Bibliography

listing | bibtex
Jean Cardinal
Udo Hoffmann
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)