Minimally covering a horizontally convex orthogonal polygon
Julian Keil · 1986
In this paper we present Ο(n2) time algorithms for the problems of covering a horizontally convex orthogonal polygon with the minimum number of orthogonal convex polygons and with the minimum number of orthogonal star-shaped polygons.