Recognition and Complexity of Point Visibility Graphs
Authors:
- Jean CardinalJCJean Cardinal
- Udo HoffmannUHUdo Hoffmann
- 25 October 2016
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 57 (1) , 164-178
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Universality Theorems for Inscribed Polytopes and Delaunay TriangulationsDiscrete & Computational Geometry, 2015
- Some Results on Point Visibility GraphsLecture Notes in Computer Science, 2014
- Unsolved problems in visibility graphs of points, segments, and polygonsACM Computing Surveys, 2013
- Computational Geometry2008
- Visibility Algorithms in the Plane2007
- Visibility Graphs and Oriented MatroidsDiscrete & Computational Geometry, 2002
- Oriented Matroids1999
- On recognizing and characterizing visibility graphs of simple polygonsDiscrete & Computational Geometry, 1997
- Some provably hard crossing number problemsDiscrete & Computational Geometry, 1991
- Some algebraic and geometric computations in PSPACE1988