VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
From MaRDI portal
Publication:5289293
Recommendations
- scientific article; zbMATH DE number 176589
- Reconstructing generalized staircase polygons with uniform step length
- Reconstructing generalized staircase polygons with uniform step length
- scientific article; zbMATH DE number 434872
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- On vertex guarding staircase polygons
- On the number of visibility graphs of simple polygons
- A note on the combinatorial structure of the visibility graph in simple polygons
- Visibility graphs of 2-spiral polygons (extended abstract)
- The vertex-edge visibility graph of a polygon
Cited in
(9)- Reconstructing generalized staircase polygons with uniform step length
- Reconstructing generalized staircase polygons with uniform step length
- Directed polygons as boundaries of visibility graphs
- A fast shortest path algorithm on terrain-like graphs
- Disproving a conjecture on planar visibility graphs
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Persistent graphs and cyclic polytope triangulations
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
- scientific article; zbMATH DE number 176589 (Why is no real title available?)
This page was built for publication: VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289293)
