Visibility graphs and oriented matroids
From MaRDI portal
Publication:1864182
DOI10.1007/s00454-002-2881-6zbMath1009.68097OpenAlexW1996510228MaRDI QIDQ1864182
Publication date: 17 March 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-002-2881-6
Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (7)
Coloring polygon visibility graphs and their generalizations ⋮ Computing the maximum clique in the visibility graph of a simple polygon ⋮ Recognition and complexity of point visibility graphs ⋮ Recognizing Visibility Graphs of Triangulated Irregular Networks ⋮ Non-stretchable pseudo-visibility graphs ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ Visibility graphs of point sets in the plane
This page was built for publication: Visibility graphs and oriented matroids
