VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH

Abstract
Let Γn denote the collection of visibility graphs of staircase polygons (orthogonal convex fans) which consist of n−1 horizontal steps of arbitrary lengths. We show that for n≥7 there are graphs in Γn which cannot be realized as the visibility graphs of staircase polygons with uniform step length.

This publication has 0 references indexed in Scilit: