Visibility graphs and oriented matroids
From MaRDI portal
Recommendations
Cited in
(23)- Special subgraphs of weighted visibility graphs
- A general notion of visibility graphs
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Computing the maximum clique in the visibility graph of a simple polygon
- Non-stretchable pseudo-visibility graphs
- Directed polygons as boundaries of visibility graphs
- On characterizing terrain visibility graphs
- scientific article; zbMATH DE number 5976585 (Why is no real title available?)
- A characterization of visibility graphs for pseudo-polygons
- Degree sets in polygon visibility graphs
- scientific article; zbMATH DE number 4085050 (Why is no real title available?)
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
- Reconstructing generalized staircase polygons with uniform step length
- Visibility graphs of 2-spiral polygons (extended abstract)
- Recognition and complexity of point visibility graphs
- Recognizing Visibility Graphs of Triangulated Irregular Networks
- Visibility graphs and deformations of associahedra
- Visibility graphs of point sets in the plane
- On the number of visibility graphs of simple polygons
- Coloring polygon visibility graphs and their generalizations
- A note on the combinatorial structure of the visibility graph in simple polygons
- On recognizing and characterizing visibility graphs of simple polygons
- Colouring polygon visibility graphs and their generalizations
This page was built for publication: Visibility graphs and oriented matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864182)