COMPUTATIONAL GEOMETRY COLUMN 18

DOI10.1142/S0218195993000075zbMath0771.68106OpenAlexW2141974670MaRDI QIDQ5289297

Joseph O'Rourke

Publication date: 22 August 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195993000075

zbMATH Keywords

polygon visibility graphsendpoint visibility graphssegment visibility graphs

Mathematics Subject Classification ID

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

Related Items (11)

Optimally computing a shortest weakly visible line segment inside a simple polygon ⋮ Guarding galleries where every point sees a large area ⋮ Minimal tangent visibility graphs ⋮ The vertex-edge visibility graph of a polygon ⋮ Visibility graphs of towers ⋮ On recognizing and characterizing visibility graphs of simple polygons ⋮ Disproving a conjecture on planar visibility graphs ⋮ Topologically sweeping visibility complexes via pseudotriangulations ⋮ On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\) ⋮ On the minimum size of visibility graphs ⋮ A necessary condition for a graph to be the visibility graph of a simple polygon

This page was built for publication: COMPUTATIONAL GEOMETRY COLUMN 18