Fetching the paper…
Reading the bibliography…
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.
Enumerable sets are diophantine
Yuri V. Matiyasevich · 1970
Earlier work this paper cites.
Arrangements and Spreads
Branko Grünbaum · 1972
Earlier work this paper cites.
An algorithm for planning collision-free paths among polyhedral obstacles
Tomás Lozano-Pérez and Michael A. Wesley · 1979
Earlier work this paper cites.
Art Gallery Theorems and Algorithms
Joseph O’Rourke · 1987
Earlier work this paper cites.
On the decidability of diophantine problems in combinatorial geometry
Bernd Sturmfels · 1987
Earlier work this paper cites.
Some algebraic and geometric computations in PSPACE
John Canny · 1988
Earlier work this paper cites.
The universality theorems on the classification problem of configuration varieties and convex polytopes varieties
Nicolai E. Mnëv · 1988
Earlier work this paper cites.
The intrinsic spread of a configuration in ℝ d \mathbb{R}^{d}
Jacob E. Goodman, Richard Pollack, and Bernd Sturmfels · 1990
Earlier work this paper cites.
Some provably hard crossing number problems
Daniel Bienstock · 1991
Earlier work this paper cites.
Stretchability of pseudolines is NP-hard
Peter W. Shor · 1991
Earlier work this paper cites.
Intersection graphs of segments
Jan Kratochvíl and Jirí Matoušek · 1994
Earlier work this paper cites.
On recognizing and characterizing visibility graphs of simple polygons
Subir K. Ghosh · 1997
Cited alongside, same era.
Vertex-edge pseudo-visibility graphs: Characterization and recognition
Joseph O’Rourke and Ileana Streinu · 1997
Cited alongside, same era.
Oriented Matroids
Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter M. Ziegler · 1999
Cited alongside, same era.
Visibility graphs and oriented matroids
James Abello and Krishna Kumar · 2002
Cited alongside, same era.
Universality theorems for configuration spaces of planar linkages
Michael Kapovich and John J. Millson · 2002
Cited alongside, same era.
Convex Polytopes
Branko Grünbaum · 2003
Cited alongside, same era.
Complexity of some geometric and topological problems
Marcus Schaefer · 2009
Later among the works it cites.
On visibility and blockers
Attila Pór and David R. Wood · 2010
Later among the works it cites.
Simple realizability of complete abstract topological graphs in P
Jan Kynčl · 2011
Later among the works it cites.
On the connectivity of visibility graphs
Michael S. Payne, Attila Pór, Pavel Valtr, and David R. Wood · 2012
Later among the works it cites.
Realizability of graphs and linkages
Marcus Schaefer · 2012
Later among the works it cites.
Unsolved problems in visibility graphs of points, segments, and polygons
Subir K. Ghosh and Partha P. Goswami · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jan Kára, Attila Pór, and David R. Wood · 2005
Cited alongside, same era.
Non-stretchable pseudo-visibility graphs
Ileana Streinu · 2005
Cited alongside, same era.
Visibility Algorithms in the Plane
Subir K. Ghosh · 2007
Cited alongside, same era.
Computational Geometry: Algorithms and Applications
Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars · 2008
Cited alongside, same era.
Geometrie der Lage
Karl Georg Christian Staudt
Cited in the paper.
Colin McDiarmid and Tobias Müller · 2013
Later among the works it cites.
Some results on point visibility graphs
Subir K. Ghosh and Bodhayan Roy · 2014
Later among the works it cites.
Point visibility graph recognition is NP-hard
Bodhayan Roy · 2014
Later among the works it cites.
Universality theorems for inscribed polytopes and Delaunay triangulations
Karim A. Adiprasito, Arnau Padrol, and Louis Theran · 2015
Closest in time.