VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
From MaRDI portal
Publication:5289293
DOI10.1142/S0218195993000038zbMath0771.68098MaRDI QIDQ5289293
Publication date: 22 August 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Related Items (7)
Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ Disproving a conjecture on planar visibility graphs ⋮ ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ Persistent graphs and cyclic polytope triangulations ⋮ A fast shortest path algorithm on terrain-like graphs
This page was built for publication: VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH