Recognizing visibility graphs of spiral polygons

DOI10.1016/0196-6774(90)90026-BMaRDI QIDQ3470110zbMATH OpenFDO

Authors

Publication date 1990

Published in Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

complexity of computationrecognition problem for visibility graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Visibility graphs of 2-spiral polygons (extended abstract)
• Visibility Graphs of Anchor Polygons
• scientific article; zbMATH DE number 4085050
• On recognizing and characterizing visibility graphs of simple polygons
• Visibility graphs of anchor polygons

Cited in

(23)

• Flipping in spirals
• Visibility Graphs of Anchor Polygons
• A necessary condition for a graph to be the visibility graph of a simple polygon
• Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)
• POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION
• Negative results on characterizing visibility 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
• FO model checking on geometric graphs
• Proper interval graphs and the guard problem
• Visibility graphs of anchor polygons
• Visibility graphs of 2-spiral polygons (extended abstract)
• Computing the maximum clique in the visibility graph of a simple polygon
• Determining bar-representability for ordered weighted graphs
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
• Recognizing polygons, or how to spy
• Reconstructing generalized staircase polygons with uniform step length
• Reconstructing generalized staircase polygons with uniform step length
• Isomorphism of spiral polygons
• Disproving a conjecture on planar visibility graphs
• On recognizing and characterizing visibility graphs of simple polygons
• Efficient algorithms for shortest distance queries on special classes of polygons
• Visibility graphs of towers

This page was built for publication: Recognizing visibility graphs of spiral polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470110)