minimally covering a horizontally convex orthogonal polygon
In this paper we present &Ogr;( n 2 ) 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.
polygon paper timing algorithm