VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
From MaRDI portal
Publication:5289293
DOI10.1142/S0218195993000038zbMATH Open0771.68098MaRDI QIDQ5289293FDOQ5289293
Authors: James Abello, Ömer Eğecioğlu 
Publication date: 22 August 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Cited In (9)
- Directed polygons as boundaries of visibility graphs
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- A fast shortest path algorithm on terrain-like graphs
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
- Reconstructing generalized staircase polygons with uniform step length
- Reconstructing generalized staircase polygons with uniform step length
- Persistent graphs and cyclic polytope triangulations
- Disproving a conjecture on planar visibility graphs
- Title not available (Why is that?)
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)
