Recognizing visibility graphs of spiral polygons
From MaRDI portal
Publication:3470110
DOI10.1016/0196-6774(90)90026-BzbMath0694.68030MaRDI QIDQ3470110
No author found.
Publication date: 1990
Published in: Journal of Algorithms (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (20)
An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons ⋮ FO model checking on geometric graphs ⋮ Characterizing and recognizing the visibility graph of a funnel-shaped polygon ⋮ Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains ⋮ Negative results on characterizing visibility graphs ⋮ Proper interval graphs and the guard problem ⋮ Determining bar-representability for ordered weighted graphs ⋮ Visibility graphs of 2-spiral polygons (Extended abstract) ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ Efficient algorithms for shortest distance queries on special classes of polygons ⋮ Computing the maximum clique in the visibility graph of a simple polygon ⋮ Flipping in spirals ⋮ Visibility graphs of towers ⋮ On recognizing and characterizing visibility graphs of simple polygons ⋮ Disproving a conjecture on planar visibility graphs ⋮ POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ Isomorphism of spiral polygons ⋮ Visibility Graphs of Anchor Polygons ⋮ A necessary condition for a graph to be the visibility graph of a simple polygon
This page was built for publication: Recognizing visibility graphs of spiral polygons
