Unsolved problems in visibility graphs of points, segments, and polygons

Authors:
Subir K. Ghosh;Partha P. Goswami
Affiliations:
Tata Institute of Fundamental Research, Mumbai, India;University of Calcutta, Kolkata, India
Venue:
ACM Computing Surveys (CSUR)
Year:
2013

Citing 74
Cited 0

The power of geometric duality

BIT - Ellis Horwood series in artificial intelligence
Visibility of disjoint polygons

Algorithmica
On shortest paths in polyhedral spaces

SIAM Journal on Computing
Computational complexity of art gallery problems

IEEE Transactions on Information Theory
Constructing arrangements of lines and hyperplanes with applications

SIAM Journal on Computing
Art gallery theorems and algorithms

Art gallery theorems and algorithms
A note on visibility graphs

Discrete Mathematics
On recognizing and characterizing visibility graphs of simple polygons

No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Hiding people in polygons

Computing
Computing simple circuits from a set of line segments is NP-complete

SIAM Journal on Computing
Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)
Recognizing visibility graphs of spiral polygons

Journal of Algorithms
Computing simple circuits from a set of line segments

Discrete & Computational Geometry
An output-sensitive algorithm for computing visibility

SIAM Journal on Computing
Some results on visibility graphs

Discrete Applied Mathematics - Special issue: combinatorial methods in VLSI
Almost tight bounds for &egr;-nets

Discrete & Computational Geometry
Hamiltonian triangulations and circumscribing polygons of disjoint line segments

Computational Geometry: Theory and Applications
On a counterexample to a conjecture of Mirzaian

Computational Geometry: Theory and Applications
Characterizing and recognizing weak visibility polygons

Computational Geometry: Theory and Applications
Two segment classes with Hamiltonian visibility graphs

Computational Geometry: Theory and Applications
Negative results on characterizing visibility graphs

Computational Geometry: Theory and Applications
Determining bar-representability for ordered weighted graphs

Computational Geometry: Theory and Applications
Visibility graphs of towers

Computational Geometry: Theory and Applications
Rectangle-visibility representations of bipartite graphs

Discrete Applied Mathematics
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Vertex-edge pseudo-visibility graphs: characterization and recognition

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Stabbing information of a simple polygon

Discrete Applied Mathematics
Characterizing bar line-of-sight graphs

SCG '85 Proceedings of the first annual symposium on Computational geometry
Computing the largest empty convex subset of a set of points

SCG '85 Proceedings of the first annual symposium on Computational geometry
Planar segment visibility graphs

Computational Geometry: Theory and Applications
An algorithm for planning collision-free paths among polyhedral obstacles

Communications of the ACM
Inapproximability of finding maximum hidden sets on polygons and terrains

Computational Geometry: Theory and Applications
Lectures on Discrete Geometry

Lectures on Discrete Geometry
Orthogonal polygon reconstruction from stabbing information

Computational Geometry: Theory and Applications
Planar sets containing no three collinear points and non-averaging sets of integers

Discrete Mathematics
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Open Problems in Computational Geometry

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Rectangle Visibility Graphs: Characterization, Construction, and Compaction

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On Rectangle Visibility Graphs

GD '96 Proceedings of the Symposium on Graph Drawing
Visibility Graphs and Oriented Matroids

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
On Rectangle Visibility Graphs. III. External Visibility and Complexity

Proceedings of the 8th Canadian Conference on Computational Geometry
Segment endpoint visibility graphs are Hamiltonian

Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Proximity and reachability in the plane.

Proximity and reachability in the plane.
Hierarchical decomposition of polygons with applications

Hierarchical decomposition of polygons with applications
Visibility graph recognition

Visibility graph recognition
Alternating paths through disjoint line segments

Information Processing Letters
On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane

Discrete & Computational Geometry
Visibility Algorithms in the Plane

Visibility Algorithms in the Plane
Computing the maximum clique in the visibility graph of a simple polygon

Journal of Discrete Algorithms
Further Results on Bar k-Visibility Graphs

SIAM Journal on Discrete Mathematics
The Empty Hexagon Theorem

Discrete & Computational Geometry
Empty Convex Hexagons in Planar Point Sets

Discrete & Computational Geometry
Visibility Graphs of Point Sets in the Plane

Discrete & Computational Geometry
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry

International Journal of Robotics Research
Blocking Visibility for Points in General Position

Discrete & Computational Geometry - Special Issue Dedicated to the Memory of Victor Klee
Non-stretchable pseudo-visibility graphs

Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Note: Approximation algorithms for art gallery problems in polygons

Discrete Applied Mathematics
Thickness of bar 1-visibility graphs

GD'06 Proceedings of the 14th international conference on Graph drawing
Every Large Point Set contains Many Collinear Points or an Empty Pentagon

Graphs and Combinatorics
Graphs with large obstacle numbers

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

SIAM Journal on Computing
A polygon is determined by its angles

Computational Geometry: Theory and Applications
A new upper bound for the VC-dimension of visibility regions

Proceedings of the twenty-seventh annual symposium on Computational geometry
Improved Approximation for Guarding Simple Galleries from the Perimeter

Discrete & Computational Geometry
Geometric Approximation Algorithms

Geometric Approximation Algorithms
Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Unit bar-visibility layouts of triangulated polygons

GD'04 Proceedings of the 12th international conference on Graph Drawing
Approximation algorithms for art gallery problems in polygons and terrains

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Reconstructing visibility graphs with simple robots

Theoretical Computer Science
A combinational approach to polygon similarity

IEEE Transactions on Information Theory
On the Connectivity of Visibility Graphs

Discrete & Computational Geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this survey article, we present open problems and conjectures on visibility graphs of points, segments, and polygons along with necessary backgrounds for understanding them.