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

DOI10.1145/2543581.2543589zbMath1288.05056arXiv1012.5187OpenAlexW2163841363MaRDI QIDQ5419182

Partha P. Goswami, Subir Kumar Ghosh

Publication date: 5 June 2014

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.5187

zbMATH Keywords

polygonssegmentsvisibility graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ A Characterization of Visibility Graphs for Pseudo-polygons ⋮ Grid obstacle representation of graphs ⋮ Coloring polygon visibility graphs and their generalizations ⋮ Visibility graphs, dismantlability, and the cops and robbers game ⋮ The parameterized complexity of guarding almost convex polygons ⋮ One-sided terrain guarding and chordal graphs ⋮ On colouring point visibility graphs ⋮ Computational complexity aspects of point visibility graphs ⋮ Obstacle Numbers of Planar Graphs ⋮ Recognition and complexity of point visibility graphs ⋮ The partial visibility representation extension problem ⋮ A fast shortest path algorithm on terrain-like graphs ⋮ Some results on point visibility graphs

This page was built for publication: Unsolved problems in visibility graphs of points, segments, and polygons