Staircase Kernels for Orthogonal d-Polytopes.
Let and be fixed, , , and let be a simply connected orthogonal polygon in the plane. For lies in a staircase -convex orthogonal polygon in if and only if every two points of see each other via staircase -paths in . This leads to a characterization for those sets expressible as a union of staircase -convex polygons , .
Page 1