For a rectilinear polygon which is half-orthogonally convex (i.e.
The number of orthogonally-convex components in a minimum covering can, in some cases, be found without finding the covering itself, in time O(n) [REF].