The vertex-edge visibility graph of a polygon

DOI10.1016/S0925-7721(97)00011-4zbMath0896.68146OpenAlexW1987507273MaRDI QIDQ1388137

Joseph O'Rourke, Ileana Streinu

Publication date: 1 October 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00011-4

zbMATH Keywords

vertex visibility graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Orthogonal polygon reconstruction from stabbing information ⋮ A Characterization of Visibility Graphs for Pseudo-polygons ⋮ On colourability of polygon visibility graphs ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Non-stretchable pseudo-visibility graphs ⋮ Algorithms for Computing Diffuse Reflection Paths in Polygons ⋮ On Colourability of Polygon Visibility Graphs ⋮ Art gallery problem with guards whose range of vision is \(180^{\circ}\)

Cites Work

• On recognizing and characterizing visibility graphs of simple polygons
• Semispaces of configurations, cell complexes of arrangements
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• An optimal visibility graph algorithm for triangulated simple polygons
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• COMPUTATIONAL GEOMETRY COLUMN 18
• THE VISIBILITY COMPLEX