Two points p andq in a polygonP are said to O -see each other if an O -staircase fromp toq exists that is completely contained inP. The O -kernel of a polygonP ...

For. Euclidean visibility, the computation of the kernel is a well-studied problem for which several optimal algorithms have been developed [CG], [LP], whereas ...

Staircase visibility and computation of kernels · S. Schuierer, D. Wood · Published in Algorithmica 1 July 1995 · Mathematics, Computer Science.

Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P.

We consider the problem of finding the staircase kernel in orthogonal polygons, with or without holes, in the plane. Orthogonal.

The necessary geometric properties are proved, and used to derive a quadratic time, O ( n 2) algorithm for computing the staircase kernel of an orthogonal ...

We generalize the notion of visibility in the following way: We say that two points a and b in an orthogonal polygon P are visible to each other via staircase ...

We consider the problem of finding the staircase kernel in orthogonal polygons, with or without holes, in the plane. Orthogonal polygon is a simple polygon ...

In this paper, we prove that every orthogonal polygon with n vertices admits a finite witness set with witnesses under rectangular, staircase, and k-periscope ...