Pages that link to "Item:Q1900971"
From MaRDI portal
The following pages link to Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains (Q1900971):
Displaying 12 items.
- Visibility graphs of towers (Q676570) (← links)
- On recognizing and characterizing visibility graphs of simple polygons (Q677018) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains (Q1900971) (← links)
- Persistent graphs and cyclic polytope triangulations (Q2043765) (← links)
- A fast shortest path algorithm on terrain-like graphs (Q2046450) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4625103) (← links)
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES (Q4682206) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4961754) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH (Q5289293) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
